Explore relationships
Set packing
Set packing is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems.
Use + to expand a branch. Click a topic name to open its summary.
Explore relationships
Set packing is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems.
Use + to expand a branch. Click a topic name to open its summary.