The aim of this paper is to present a proof of the equivalence of the equalities N P = PCP(log log n; 1) and P = N P. The proof is based on producing long pseudo-random bit strings through random walks on expander graphs. This technique also implies that for any language in N P there exists a restricted veriier using log n + c, c is a constant, random bits. Furthermore, we prove that the equali...