Explore relationships

Strongly NP-complete

In computational complexity, strong NP-completeness is a property of computational problems that is a special case of NP-completeness. A general computational problem may have numerical parameters.

Use + to expand a branch. Click a topic name to open its summary.