Probabilistic quantifiers vs. distrustful adversaries

Authors:
Stathis Zachos;Martin Furer
Affiliations:
Brooklyn College of the City Univ. of New York, New York, NY;Univ. of Zurich, Zurich, Switzerland
Venue:
Proc. of the seventh conference on Foundations of software technology and theoretical computer science
Year:
1987

Citing 0
Cited 7

On Higher Arthur-Merlin Classes

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy

Theoretical Computer Science
Fast amplification of QMA

Quantum Information & Computation
On perfect completeness for QMA

Quantum Information & Computation
Another proof that BPP ⊆ PH (and more)

Studies in complexity and cryptography
Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems

Quantum Information & Computation
Stronger methods of making quantum interactive proofs perfectly complete

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract