Proof — NP-completeness column

Statement

Garey–Johnson; Computers and Intractability; algorithm design. Proved in ZFC.

Source

Donald E. Knuth Prize 2010. Garey–Johnson; Computers and Intractability; algorithm design. Proved in ZFC.

Domains

computer-science

People

Related

Explore

Canonical: https://axiom.tanaakk.com/proof/david-johnson-knuth-2010/