The complexity of the max word problem and the power of one-way interactive proof systems-Reference-Cited by-同舟云学术

The complexity of the max word problem and the power of one-way interactive proof systems

Published:1993-09 Issue:3 Volume:3 Page:292-305
ISSN:1016-3328
Container-title:Computational Complexity
language:en
Short-container-title:Comput Complexity

Author:

Condon Anne

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01271372.pdf

Reference19 articles.

1. J.-P. Allouche andJ. Shallit, The ring ofk-regular sequences, inProceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science, 1990, 12?23.

2. S. Arora, C. Lund, R. Motwani, M. Sudan andM. Szegedy, Proof verification and hardness of approximation problems, inProceedings of the 34th Annual IEEE Symposium on the Foundations of Computer Science, 1992, 14?23.

3. A. Arona andS. Safra, Approximating clique is NP-complete, inProceedings of the 34th Annual IEEE Symposium on the Foundations of Computer Science, 1992, 2?13.

4. L. Babai, Trading group theory for randomness, inProceedings of 17th Annual Symposium on the Theory of Computing, 1985, 421?429.

5. L. Babai, L. Fortnow andC. Lund, Non-deterministic exponential time has two-prover interactive protocols,Computational Complexity 1 (1991a), 3?40.

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Constant-space, constant-randomness verifiers with arbitrarily small error;Information and Computation;2021-03

2. Finite state verifiers with constant randomness;Logical Methods in Computer Science;2014-08-19

3. The Complexity of Debate Checking;Theory of Computing Systems;2014-08-13

4. Inapproximability of Combinatorial Optimization Problems;Paradigms of Combinatorial Optimization;2014-08-08

5. General Bibliography;Paradigms of Combinatorial Optimization;2014-08-08