isNPComplete

P142024 predicate

Indicates that a decision problem is both in NP and NP-hard, meaning it can be verified in polynomial time and is at least as hard as any problem in NP.

Try in SPARQL

Observed surface forms (1)

isInClassNPBecause ×1

Sample triples (3)

Subject	Object
Max-SAT	false ⓘ
SAT	a satisfying assignment can be verified in polynomial time via predicate surface "isInClassNPBecause" ⓘ
SAT problem	true ⓘ