Main
Home
/
Tags
/
BLR
BLR
1 page tagged.
Computer science / Coursework / Randomized algorithms
Lecture 7: Interactive Proofs & PCP Theorem
IP = PSPACE via arithmetization and the sum-check protocol, then the PCP theorem NP = PCP[O(log n), O(1)] — proofs checkable in O(1) bits — so approximating Max-3-SAT is NP-hard.