Publication View

[4] S. Arora and S. Safra. Probabilistic Checkable Proofs: A New Characterization of NP. JACM, (2008)

Abstract

traversal sequences, and the complexity of maze problems. In 20th FOCS, pages 218-223, 1979.

Publication details

Download	http://citeseerx.ist.psu.edu/viewdoc/summary?doi=?doi=10.1.1.125.8896
Source	http://www.wisdom.weizmann.ac.il/~oded/PS/CC/notes4.ps
Contributors	CiteSeerX
Repository	CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Type	text
Language	English