Sciweavers

72
Voted
FOCS
1992
IEEE
15 years 2 months ago
Probabilistic Checking of Proofs; A New Characterization of NP
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
Sanjeev Arora, Shmuel Safra