Home / Computer science / NP-complete
Proofs
To prove a problem \(L\) is NP-complete,
reduce a known NP-complete problem to \(L\).
in polynomial time.
Home / Computer science / NP-complete
To prove a problem \(L\) is NP-complete,
reduce a known NP-complete problem to \(L\).
in polynomial time.