Sign inSign in

PCP theorem

A theorem stating that approximating Max-E3Sat to within some constant factor strictly less than 1 is NP-hard.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 8 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A theorem stating that it is NP-hard to distinguish whether a 3-coloring instance has an optimal assignment of 1 or at most 1−ϵ01 - \epsilon_0 for some universal constant ϵ0>0\epsilon_0 > 0.
    • 1:10:56Probability Densities and BLR Linearity Testing
    • 22:08CSP Approximability: Optimization and Certification
    • 5:26Dinur's Proof of the PCP Theorem: Outline
    • 2:47Statement of the PCP Theorem
    • 17:11Beyond Worst-Case Analysis
    • 1:00:05Probabilistically Checkable Proofs of Proximity
  • Avi Wigderson

    Institute for Advanced Study · Undergraduate

    A theorem providing an optimization dichotomy for constraint satisfaction problems concerning approximation.
    • 29:30Mathematics and Computation: The Landscape of P vs. NP

Lectures that assume it

5

Connections

22

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.