Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Does co-NP have short interactive proofs?
Information Processing Letters
Hiding instances in multioracle queries
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
PSPACE is provable by two provers in one round
Journal of Computer and System Sciences
Fast algorithms for finding randomized strategies in game trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Designing programs that check their work
Journal of the ACM (JACM)
Approximate solutions to problems in PSPACE
ACM SIGACT News
On computational complexity and the nature of computer science
ACM Computing Surveys (CSUR)
Turing Award lecture on computational complexity and the nature of computer science
Communications of the ACM
A formalization of the Turing test
ACM SIGART Bulletin
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Making games short (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Retraction of probabilistic computation and linear time
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On transformation of interactive proofs that preserve the prover's complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On zero-knowledge proofs (extended abstract): “from membership to decision”
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Randomness efficient identity testing of multivariate polynomials
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Some optimal inapproximability results
Journal of the ACM (JACM)
A formal framework for evaluating heuristic programs
Annals of Mathematics and Artificial Intelligence
Some facets of complexity theory and cryptography: A five-lecture tutorial
ACM Computing Surveys (CSUR)
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
Deterministic identity testing for multivariate polynomials
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On Interactive Proofs with a Laconic Prover
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On Higher Arthur-Merlin Classes
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
A Relationship between One-Wayness and Correlation Intractability
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
Commitment Schemes and Zero-Knowledge Protocols
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
PSPACE has constant-round quantum interactive proof systems
Theoretical Computer Science - Algorithms,automata, complexity and games
One complexity theorist's view of quantum computing
Theoretical Computer Science - Algorithms,automata, complexity and games
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A Nonadaptive NC Checker for Permutation Group Intersection
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
PSPACE Has Constant-Round Quantum Interactive Proof Systems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum multi-prover interactive proof systems with limited prior entanglement
Journal of Computer and System Sciences
On interactive proofs with a laconic prover
Computational Complexity
Interactive and Probabilistic Proof of Mobile Code Safety
Automated Software Engineering
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Quantum Information and the PCP Theorem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Hausdorff dimension and oracle constructions
Theoretical Computer Science
Progress in computational complexity theory
Journal of Computer Science and Technology
SIGACT news complexity theory column 52
ACM SIGACT News
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
The PCP theorem by gap amplification
Journal of the ACM (JACM)
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Circuit lower bounds for Merlin-Arthur classes
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Turing award lecture: on computational complexity and the nature of computer science
ACM Turing award lectures
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
Theoretical Computer Science
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
Delegating computation: interactive proofs for muggles
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Universal semantic communication I
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algebrization: a new barrier in complexity theory
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Probabilistic Proof Systems: A Primer
Foundations and Trends® in Theoretical Computer Science
Lower Bounds for Swapping Arthur and Merlin
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Probabilistically checkable proofs
Communications of the ACM - Being Human in the Digital Age
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters
Algebrization: A New Barrier in Complexity Theory
ACM Transactions on Computation Theory (TOCT)
An application of quantum finite automata to interactive proof systems
Journal of Computer and System Sciences
NPMV-Complete Functions That Compute Discrete Logarithms and Integer Factorization
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
An axiomatic approach to algebrization
Proceedings of the forty-first annual ACM symposium on Theory of computing
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
SIGACT news complexity theory column 64
ACM SIGACT News
Nonapproximability results for partially observable Markov decision processes
Journal of Artificial Intelligence Research
The relativized relationship between probabilistically checkable debate systems, IP and PSPACE
Information Processing Letters
The ideal membership problem and polynomial identity testing
Information and Computation
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Complexity theory made easy: the formal language approach to the definition of complexity classes
DLT'03 Proceedings of the 7th international conference on Developments in language theory
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Software integrity checking expressions (ICEs) for robust tamper detection
IH'07 Proceedings of the 9th international conference on Information hiding
Incrementally verifiable computation or proofs of knowledge imply time/space efficiency
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Interactive and noninteractive zero knowledge are equivalent in the help model
TCC'08 Proceedings of the 5th conference on Theory of cryptography
BQP and the polynomial hierarchy
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the forty-second ACM symposium on Theory of computing
Communications of the ACM
Avoiding simplicity is complex
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Improved delegation of computation using fully homomorphic encryption
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Other complexity classes and measures
Algorithms and theory of computation handbook
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
On complete problems, relativizations and logics for complexity classes
Fields of logic and computation
High-rate codes with sublinear-time decoding
Proceedings of the forty-third annual ACM symposium on Theory of computing
Studies in complexity and cryptography
The complexity of testing monomials in multivariate polynomials
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Algorithms for testing monomials in multivariate polynomials
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
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
Verifying computations with streaming interactive proofs
Proceedings of the VLDB Endowment
Journal of the ACM (JACM)
Entangled Games Are Hard to Approximate
SIAM Journal on Computing
Practical verified computation with streaming interactive proofs
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Quantum interactive proofs with weak error bounds
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Entanglement in interactive proof systems with binary answers
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
An analytic criterion for CSAT
Information Processing Letters
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Quantum interactive proofs with competing provers
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
An application of quantum finite automata to interactive proof systems (extended abstract)
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
A theory of goal-oriented communication
Journal of the ACM (JACM)
Playing savitch and cooking games
Concurrency, Compositionality, and Correctness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Survey: A glimpse at Christos H. Papadimitriou
Computer Science Review
Finite state verifiers with constant randomness
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Zero-Knowledge proofs via polynomial representations
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Software Engineering and complexity in effective Algebraic Geometry
Journal of Complexity
Instance compression for the polynomial hierarchy and beyond
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Journal of Combinatorial Optimization
Succinct non-interactive arguments via linear interactive proofs
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Interactive proofs of proximity: delegating computation in sublinear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A new family of locally correctable codes based on degree-lifted algebraic geometry codes
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Guest column: the quantum PCP conjecture
ACM SIGACT News
On testing monomials in multivariate polynomials
Theoretical Computer Science
Proceedings of the 2013 ACM workshop on Artificial intelligence and security
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
Verifying computations with state
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Verifying the correctness of remote executions: from wild implausibility to near practicality
Proceedings of the 9th Workshop on Hot Topics in Dependable Systems
| Hi-index | 0.04 |
In this paper, it is proven that when both randomization and interaction are allowed, the proofs that can be verified in polynomial time are exactly those proofs that can be generated with polynomial space.