PCP and error-correcting codes

Statement

Probabilistically checkable proofs; list decoding; inapproximability. Proved in ZFC.

Source

IMU Abacus Medal 2002. Probabilistically checkable proofs; list decoding; inapproximability. Proved in ZFC.

Domains

computer-science

People

Related

Explore

Canonical: https://axiom.tanaakk.com/theorem/sudan-abacus-2002/