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
Are there interactive protocols for CO-NP languages?
Information Processing Letters
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Everything provable is provable in zero-knowledge
CRYPTO '88 Proceedings on Advances in cryptology
Hiding instances in multioracle queries
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Interactive proof systems and alternating time-space complexity
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Direct Minimum-Knowledge Computations
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On Some Central Problems in Computational Complexity
On Some Central Problems in Computational Complexity
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
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
PSPACE is provable by two provers in one round
Journal of Computer and System Sciences
Designing programs that check their work
Journal of the ACM (JACM)
The isomorphism conjecture fails relative to a random oracle
Journal of the ACM (JACM)
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
Software reliability via run-time result-checking
Journal of the ACM (JACM)
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
Chinese remaindering with errors
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
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
Some optimal inapproximability results
Journal of the ACM (JACM)
A formal framework for evaluating heuristic programs
Annals of Mathematics and Artificial Intelligence
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
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Competing Provers Yield Improved Karp-Lipton Collapse Results
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
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
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
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
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Quantum Information and the PCP Theorem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A note on the circuit complexity of PP
Theoretical Computer Science
Hausdorff dimension and oracle constructions
Theoretical Computer Science
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
Computational Complexity
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
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
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
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
Two-query PCP with subconstant error
Journal of the ACM (JACM)
The monomial ideal membership problem and polynomial identity testing
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Interactive and noninteractive zero knowledge are equivalent in the help model
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Proceedings of the forty-second ACM symposium on Theory of computing
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
Proceedings of the forty-second ACM symposium on Theory of computing
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
Short locally testable codes and proofs: a survey in two parts
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
High-rate codes with sublinear-time decoding
Proceedings of the forty-third annual ACM symposium on Theory of computing
Black-box identity testing of depth-4 multilinear circuits
Proceedings of the forty-third annual ACM symposium on Theory of computing
Short locally testable codes and proofs
Studies in complexity and cryptography
Studies in complexity and cryptography
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Almost transparent short proofs for NPR
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
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
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
A theory of goal-oriented communication
Journal of the ACM (JACM)
2log1-ε n hardness for the closest vector problem with preprocessing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Two protocols for delegation of computation
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
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
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
Information and Computation
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
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.01 |
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an interactive proof system. This technique played a pivotal role in the recent proofs that IP = PSPACE [28] and that MIP = NEXP [4].