SIGACT News Complexity Theory Column 60 Lane A. Hemaspaandra Dept. of Computer Science, University of Rochester Rochester, NY 14627, USA Introduction to Complexity Theory Column 60 Warmest thanks to Irit for her wonderful column. (Although writing such articles is a true labor of love, it is also a time-hungry task, and I m impressed each issue by the tremendous time-generosity of the guest columnists, both in this and the other columns.) Next issue s complexity column will be by Ryan Williams, tentatively to be about automated proofs of time lower bounds. The current issue will reach your hands right around the start of a new academic year. Best wishes to all for a research year full of challenges and advances. Guest Column: PCPs with Small Soundness Error1 Irit Dinur2 Abstract The soundness error of a PCP veri er is the probability (usually denoted ) that the veri er accepts an incorrect input. We are interested in the smallest possible values of for which the PCP theorem holds, and in particular whether the theorem holds when is an inverse polynomial function of the input length. We discuss the sliding scale conjecture of [BGLR93, LY94] and related questions. We
/lp/association-for-computing-machinery/pcps-with-small-soundness-error-mErulzS5wy