Randomness in interactive proofs
Computational Complexity
Random Debaters and the Hardness of Approximating Stochastic Functions
SIAM Journal on Computing
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Hardness amplification within NP
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the complexity of approximating the VC dimension
Journal of Computer and System Sciences - Complexity 2001
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Using Nondeterminism to Amplify Hardness
SIAM Journal on Computing
The PCP theorem by gap amplification
Journal of the ACM (JACM)
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
SIAM Journal on Computing
Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
SIAM Journal on Computing
Randomness-Efficient Sampling within NC1
Computational Complexity
Low-End Uniform Hardness versus Randomness Tradeoffs for AM
SIAM Journal on Computing
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
SIAM Journal on Computing
Efficient probabilistically checkable debates
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On the power of many one-bit provers
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Hi-index | 0.00 |
We introduce a 2-round stochastic constraint-satisfaction problem, and show that its approximation version is complete for (the promise version of) the complexity class AM. This gives a "PCP characterization" of AM analogous to the PCP Theorem for NP. Similar characterizations have been given for higher levels of the Polynomial Hierarchy, and for PSPACE; however, we suggest that the result for AM might be of particular significance for attempts to derandomize this class. To test this notion, we pose some hypotheses related to our stochastic CSPs that (in light of our result) would imply collapse results for AM. Unfortunately, the hypotheses may be over-strong, and we present evidence against them. In the process we show that, if some language in NP is hard-on-average against circuits of size 2Ω(n), then there exist "inapproximable-on-average" optimization problems of a particularly elegant form. All our proofs use a powerful form of PCPs known as Probabilistically Checkable Proofs of Proximity, and demonstrate their versatility. We also use known results on randomness-efficient soundness- and hardnessamplification. In particular, we make essential use of the Impagliazzo-Wigderson generator; our analysis relies on a recent Chernoff-type theorem for expander walks.