Random debaters and the hardness of approximating stochastic functions

@article{Condon1994RandomDA,
  title={Random debaters and the hardness of approximating stochastic functions},
  author={Anne Condon and Joan Feigenbaum and Carsten Lund and Peter W. Shor},
  journal={Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory},
  year={1994},
  pages={280-293}
}
  • A. Condon, J. Feigenbaum, +1 author P. Shor
  • Published 1994
  • Mathematics, Computer Science
  • Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory
A random probabilistically checkable debate system (RPCDS) for a language L consists of a probabilistic polynomial-time verifier V and a debate between Player 1, who aims to prove that the input x is in L, and Player 0, who selects a move uniformly at random from the set of legal moves. This model is a natural restriction of the PCDS model (Condon et al., Proc. 25th ACM Symposium on Theory of Computing, p.304-15, 1993,). We show that L has an RPCDS in which the verifier flips O(log n) coins and… Expand
Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions
TLDR
This characterization of PSPACE is used to show that certain PSPACE-hard functions are as hard to approximate closely as they are to compute exactly. Expand
Checking generalized debates with small space and randomness
We introduce a model of probabilistic debate checking, where a silent resource-bounded verifier reads a dialogue about the membership of the string in the language under consideration between aExpand
Pspace-hard Functions Checkable Debate Systems and Approximation Algorithms for Pspace
to use journal articles in a variety of ways, limited only as required to insure fair attribution to authors and the journal, and to prohibit use in a competing commercial product. See the journal'sExpand
Probabilistic verifiers for asymmetric debates
TLDR
It is shown that the membership problem for every language in NSPACE(s(n)) has a 2 s(n) -time debate where one prover is completely blind to the other one, and a probabilistic finite automaton can solve any decision problem in P with small error in polynomial time with the aid of such a debate. Expand
Probabilistic checking of proofs and hardness of approximation problems
This dissertation establishes a surprising new characterization of NP, the class of languages for which membership proofs can be checked in polynomial time deterministically. The class NP is exactlyExpand
Explorer A PCP Characterization of AM
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 ‘PCPExpand
The Relativized Relationship Between Probabilistically Chackable Debate Systems, IP and PSPACE
TLDR
A natural boundary is determined separating direct-simulability and inequality (with probability 1) between PSPACE and IP and it is shown that if @?O, EXP^O[log n, log n] then P PSPACE. Expand
PCPs for Arthur-Merlin Games and Communication Protocols
TLDR
This thesis gives a ‘PCP characterization’ of AM analogous to the PCP Theorem for NP, and shows that, if some language in NP is hard-on-average against circuits of size 2, then there exist hard- on-average optimization problems of a particularly elegant form. Expand
A PCP Characterization of AM
TLDR
A 2-round stochastic constraint-satisfaction problem is introduced, and its approximation version is complete for (the promise version of) the complexity class AM, which gives a "PCP characterization" of AM analogous to the PCP Theorem for NP. Expand
Linear logic proof games and optimization
TLDR
The surprising discovery is that the deterministic proof checker that reads the entire input and proof can be replaced by a probabilistic verifier that flips at most O (log ∣ x ∣) coins and reads at most a constant number of bits of x and y. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 52 REFERENCES
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
TLDR
This characterization of PSPACE is used to show that certain PSPACE-hard functions are as hard to approximate as they are to compute exactly. Expand
Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions
TLDR
This characterization of PSPACE is used to show that certain PSPACE-hard functions are as hard to approximate closely as they are to compute exactly. Expand
Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems
  • M. Sudan
  • Mathematics, Computer Science
  • Lecture Notes in Computer Science
  • 1995
TLDR
Results from coding theory are used as a starting point and several algorithmic techniques including pairwise independent sampling to give efficient randomized algorithms for error-detection and error-correction for some well-known codes. Expand
Proof verification and hardness of approximation problems
TLDR
The authors improve on their result by showing that NP=PCP(logn, 1), which has the following consequences: (1) MAXSNP-hard problems do not have polynomial time approximation schemes unless P=NP; and (2) for some epsilon >0 the size of the maximal clique in a graph cannot be approximated within a factor of n/sup ePSilon / unless P =NP. Expand
A theorem on probabilistic constant depth Computations
TLDR
Stockmeyer [St] showed that probabilistic bounded depth circuits can approximate the exact number of ones in the input with very low probability of error. Expand
Efficient probabilistically checkable proofs and applications to approximations
TLDR
This work constructs multi-prover proof systems for NP which use only a constant number of provers to simultaneously achieve low error, low randomness and low answer size, and shows that approximating minimum set cover within any constant is NP-complete. Expand
Probabilistic checking of proofs; a new characterization of NP
  • Sanjeev Arora, S. Safra
  • Mathematics, Computer Science
  • Proceedings., 33rd Annual Symposium on Foundations of Computer Science
  • 1992
TLDR
The authors give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs can be verified probabilistically in polynomial time using logarithmic number of random bits and sub-logarital number of queries to the proof. Expand
Efficient probabilistic checkable proofs and applications to approximation
We construct multi-prover proof systems for NP which use only a constant number of provers to simultaneously achieve low error, low randomness and low answer size. As a consequence, we obtainExpand
Generalized CNF satisfiability problems and non-efficient approximability
  • H. Hunt, M. Marathe, R. Stearns
  • Mathematics, Computer Science
  • Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory
  • 1994
TLDR
This work uses variants of the generalized CNF satisfiability problems SAT(S) of T.J. Schhaefer (1978) to characterize the efficient approximability of a number of basic NP and PSPACE-hard optimization problems in the literature, and shows that a number can be shown not to be efficiently approximable by direct reductions. Expand
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledgeExpand
...
1
2
3
4
5
...