Sparse sets in NP-P: relativizations
SIAM Journal on Computing
On relativized exponential and probabilistic complexity classes
Information and Control
NP is as easy as detecting unique solutions
Theoretical Computer Science
Matching is as easy as matrix inversion
Combinatorica
Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
Relativized counting classes: relations among thresholds, parity, and mods
Journal of Computer and System Sciences
On truth-table reducibility to SAT
Information and Computation
SIAM Journal on Computing
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Oracles for structural properties: the isomorphism problem and public-key cryptography
Journal of Computer and System Sciences
On 1-truth-table-hard languages
Theoretical Computer Science
Complexity theory
Representing Boolean functions as polynomials modulo composite numbers
Computational Complexity - Special issue on circuit complexity
The Isomorphism Conjecture Holds Relative toan Oracle
SIAM Journal on Computing
Relativized Questions Involving Probabilistic Algorithms
Journal of the ACM (JACM)
Separability and One-Way Functions
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
The Complexity of Generating and Checking Proffs of Membership
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Resource-Bounded Kolmogorov Complexity Revisited
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Two Queries
Polynomial reducibilities and complete sets.
Polynomial reducibilities and complete sets.
The cpa's responsibility for the prevention and detection of computer fraud.
The cpa's responsibility for the prevention and detection of computer fraud.
Information and Computation
Resource bounded symmetry of information revisited
Theoretical Computer Science - Mathematical foundations of computer science 2004
LWPP and WPP are not uniformly gap-definable
Journal of Computer and System Sciences
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
Computational Complexity
The complexity of symmetric Boolean parity Holant problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Completeness for parity problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |