Jump to content

Category:NP-hard problems

From Wikipedia, the free encyclopedia

See also Category:NP-complete problems

Subcategories

This category has the following 2 subcategories, out of 2 total.

N

NP-complete problems (9 C, 181 P)

O

Optimal scheduling (23 P)

Pages in category "NP-hard problems"

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

Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:NP-hard_problems&oldid=548082338"

Computational problems