set packing
0 sources
set packing
Summary
set packing is a computational problem[1]. It draws 55 Wikipedia views per month (computational_problem category, ranking #34 of 61).[2]
Key Facts
- set packing's instance of is recorded as computational problem[3].
- set packing's part of is recorded as Karp's 21 NP-complete problems[4].
- set packing's Freebase ID is recorded as /m/06fdth[5].
- set packing's Dictionary of Algorithms and Data Structures ID is recorded as setpacking[6].
- set packing's Microsoft Academic ID is recorded as 134516590[7].
- set packing's OpenAlex ID is recorded as C134516590[8].
- set packing's computational complexity is recorded as NP-complete[9].
Why It Matters
set packing draws 55 Wikipedia views per month (computational_problem category, ranking #34 of 61).[2] It has Wikipedia articles in 8 language editions, a strong signal of global cultural recognition.[10]