Category:Strongly NP-complete problems

Subcategories

This category has only the following subcategory.

P

Pseudo-polynomial time algorithms (4 P)

Pages in category "Strongly NP-complete problems"

The following 6 pages are in this category, out of 6 total. This list may not reflect recent changes.

0–9

3-partition problem

B

Bin packing problem

N

Numerical 3-dimensional matching

P

Pseudo-polynomial transformation

S

Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:Strongly_NP-complete_problems&oldid=1234029754"