Proof — Optimal inapproximability
Statement
MAX-3SAT; PCP; optimal hardness. Proved in ZFC.
Source
Donald E. Knuth Prize 2018. MAX-3SAT; PCP; optimal hardness. Proved in ZFC.
Domains
computer-science
MAX-3SAT; PCP; optimal hardness. Proved in ZFC.
Donald E. Knuth Prize 2018. MAX-3SAT; PCP; optimal hardness. Proved in ZFC.
computer-science
Canonical: https://axiom.tanaakk.com/proof/hastad-knuth-2018/