Contextualizebeta

NP-complete

adj

Definitions

  1. That is both NP (solvable in polynomial time by a non-deterministic Turing machine) and…

    That is both NP (solvable in polynomial time by a non-deterministic Turing machine) and NP-hard (such that any (other) NP problem can be reduced to it in polynomial time).

    • A problem Π is said to be NP-complete if each problem in NP is reducible to Π. Hence (4.13) if some NP-complete problem belongs to P, then P=NP.

The neighborhood

Vish — recursive loop

No curated loop yet for NP-complete. Loops are being traced one word at a time while the ingestion pipeline matures.

sense glosses and etymology drawn from English Wiktionary · source · CC-BY-SA