61 search results - page 13 / 13 » Lower bounds for graph embeddings and combinatorial precondi... |
COCO
2010
Springer
13 years 7 months ago
2010
Springer
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...