Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

FOCS

1992

IEEE

1992

IEEE

The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of its oracle and behaves as follows: If x L then there exists an oracle y such that the machine accepts for all random choices but if x L then for every oracle y the machine rejects with high probability. Arora and Safra very recently characterized NP as PCP(log n, (log log n)O(1) ). We improve on their result by showing that NP = PCP(log n, 1). Our result has the following consequences:

Related Content

Added |
27 Aug 2010 |

Updated |
27 Aug 2010 |

Type |
Conference |

Year |
1992 |

Where |
FOCS |

Authors |
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy |

Comments (0)