Journal of Computer and System Sciences
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
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Self-testing polynomial functions efficiently and over rational domains
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Highly resilient correctors for polynomials
Information Processing Letters
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fast algorithms for finding randomized strategies in game trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximate solutions to problems in PSPACE
ACM SIGACT News
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)
SIGACT news complexity theory comun 37
ACM SIGACT News
Exploiting structure in quantified formulas
Journal of Algorithms
SIGACT news complexity theory column 38
ACM SIGACT News
The complexity of approximating pspace-complete problems for hierarchical specifications
Nordic Journal of Computing
The relativized relationship between probabilistically checkable debate systems, IP and PSPACE
Information Processing Letters
Hi-index | 0.00 |