The ismorphism conjecture fails relative to a random oracle
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On reductions of NP sets to sparse sets
Journal of Computer and System Sciences
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
The isomorphism conjecture fails relative to a random oracle
Journal of the ACM (JACM)
On the limits of non-approximability of lattice problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On non-determinism in machines and languages
Annals of Mathematics and Artificial Intelligence
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)
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
The Complexity of Computing the Size of an Interval
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Is the Standard Proof System for SAT P-Optimal?
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Restrictive Acceptance Suffices for Equivalence Problems
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
If P != NP Then Some Strongly Noninvertible Functions Are Invertible
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On reducibility and symmetry of disjoint NP pairs
Theoretical Computer Science - Mathematical foundations of computer science
Information and Computation
Information and Computation
One-way permutations and self-witnessing languages
Journal of Computer and System Sciences
Separability and one-way functions
Computational Complexity
Tight lower bounds on the ambiguity of strong, total, associative, one-way functions
Journal of Computer and System Sciences
A note on quadratic residuosity and UP
Information Processing Letters
Reductions between disjoint NP-pairs
Information and Computation
If P ≠ NP then some strongly noninvertible functions are invertible
Theoretical Computer Science
Canonical disjoint NP-pairs of propositional proof systems
Theoretical Computer Science
Quantum cryptography: A survey
ACM Computing Surveys (CSUR)
Classes of representable disjoint NP-pairs
Theoretical Computer Science
Statistical Zero Knowledge and quantum one-way functions
Theoretical Computer Science
Cluster computing and the power of edge recognition
Information and Computation
Optimal Proof Systems, Optimal Acceptors and Recursive Presentability
Fundamenta Informaticae
The Shrinking Property for NP and coNP
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
The complexity of unions of disjoint sets
Journal of Computer and System Sciences
Directed Planar Reachability Is in Unambiguous Log-Space
ACM Transactions on Computation Theory (TOCT)
Nondeterministic functions and the existence of optimal proof systems
Theoretical Computer Science
Reductions between disjoint NP-Pairs
Information and Computation
A note on quadratic residuosity and UP
Information Processing Letters
The complexity of unions of disjoint sets
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
One-sided versus two-sided error in probabilistic computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Some observations on the computational complexity of graph accessibility problem
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
The deduction theorem for strong propositional proof systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Logical closure properties of propositional proof systems
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Other complexity classes and measures
Algorithms and theory of computation handbook
Proof system representations of degrees of disjoint NP-pairs
Information Processing Letters
The shrinking property for NP and coNP
Theoretical Computer Science
On quantum one-way permutations
Quantum Information & Computation
Studies in complexity and cryptography
Unions of disjoint NP-complete sets
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Disjoint NP-pairs from propositional proof systems
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Cluster computing and the power of edge recognition
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Dimension characterizations of complexity classes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Canonical disjoint NP-Pairs of propositional proof systems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On the power of unambiguity in alternating machines
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Computational indistinguishability between quantum states and its cryptographic application
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Representable disjoint NP-Pairs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Survey of disjoint NP-pairs and relations to propositional proof systems
Theoretical Computer Science
Theoretical Computer Science
A thirty year old conjecture about promise problems
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Optimal Proof Systems, Optimal Acceptors and Recursive Presentability
Fundamenta Informaticae
the informational content of canonical disjoint NP-pairs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
The complexity of online manipulation of sequential elections
Journal of Computer and System Sciences
Unions of Disjoint NP-Complete Sets
ACM Transactions on Computation Theory (TOCT)
Functions Computable with Nonadaptive Queries to NP
Theory of Computing Systems
| Hi-index | 0.01 |