isNPHard

P142025
predicate

Indicates that solving the associated problem is at least as hard as the hardest problems in NP, so no known polynomial-time algorithm can solve all its instances unless P = NP.

Try in SPARQL

Sample triples (2)

Subject Object
SAT problem true ⓘ
Max-SAT true ⓘ