A note on the complete problems for complexity classes
Information Processing Letters
Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
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
The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
The complexity of matrix transposition on one-tape off-line Turing machines
Theoretical Computer Science
Datalog extensions for database queries and updates
Journal of Computer and System Sciences
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
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)
A very hard log-space counting class
Theoretical Computer Science - Special issue on structure in complexity theory
Finite-model theory—a personal perspective
ICDT Selected papers of the 4th international conference on Database theory
Introduction to the theory of complexity
Introduction to the theory of complexity
Computing with first-order logic
Selected papers of the 23rd annual ACM symposium on Theory of computing
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Turing Award lecture on computational complexity and the nature of computer science
Communications of the ACM
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Complexity theory retrospective II
Complexity theory retrospective II
The quantitative structure of exponential time
Complexity theory retrospective II
Average-case computational complexity theory
Complexity theory retrospective II
Journal of the ACM (JACM)
An introduction to quantum computing for non-physicists
ACM Computing Surveys (CSUR)
An introduction to quantum computing
Current trends in theoretical computer science
Quantum computing
The complexity theory companion
The complexity theory companion
Quantum computation and quantum information
Quantum computation and quantum information
Handbook of Theoretical Computer Science: Algorithms and Complexity
Handbook of Theoretical Computer Science: Algorithms and Complexity
On Relativization and the Existence of Complete Sets
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Borel sets and circuit complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Mathematics of Quantum Computation
Mathematics of Quantum Computation
One-way permutations and self-witnessing languages
Journal of Computer and System Sciences
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
The PCP theorem by gap amplification
Journal of the ACM (JACM)
Two theorems on random polynomial time
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |