NP is as easy as detecting unique solutions
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A perfect zero-knowledge proof for a problem equivalent to discrete logarithm
CRYPTO '88 Proceedings on Advances in cryptology
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
Hard-core theorems for complexity classes
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
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
Robust algorithms for restricted domains
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The role of trust management in distributed systems security
Secure Internet programming
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Efficient Algorithms for the Construction of Hyperelliptic Cryptosystems
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
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
A Key Escrow System with Warrant Bounds
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Robust algorithms for restricted domains
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
On the reducibility of sets inside NP to sets with low information content
Journal of Computer and System Sciences
Reductions between disjoint NP-pairs
Information and Computation
A common algebraic description for probabilistic and quantum computations
Theoretical Computer Science - Mathematical foundations of computer science 2004
Zero knowledge with efficient provers
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Zero-knowledge against quantum attacks
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On basing one-way functions on NP-hardness
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Information and Computation
Locally testable codes and PCPs of almost-linear length
Journal of the ACM (JACM)
Foundations and Trends® in Theoretical Computer Science
Zero Knowledge and Soundness Are Symmetric
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
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 Distinguishing Markov Random Fields
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
A unifying framework for structural properties of CSPs: definitions, complexity, tractabilit
Journal of Artificial Intelligence Research
Reductions between disjoint NP-Pairs
Information and Computation
Information and Computation
Nearly bounded error probabilistic sets
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Sparse sets, approximable sets, and parallel queries to NP
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Assisted problem solving and decompositions of finite automata
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
TCC'08 Proceedings of the 5th conference on Theory of cryptography
General properties of quantum zero-knowledge proofs
TCC'08 Proceedings of the 5th conference on Theory of cryptography
An equivalence between zero knowledge and commitments
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Proceedings of the forty-second ACM symposium on Theory of computing
Compactly representing utility functions using weighted goals and the max aggregator
Artificial Intelligence
Polynomial-space approximation of no-signaling provers
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The shrinking property for NP and coNP
Theoretical Computer Science
Introduction to testing graph properties
Property testing
Introduction to testing graph properties
Property testing
Simplified derandomization of BPP using a hitting set generator
Studies in complexity and cryptography
On the average-case complexity of property testing
Studies in complexity and cryptography
Studies in complexity and cryptography
On the complexity of computational problems regarding distributions
Studies in complexity and cryptography
Introduction to testing graph properties
Studies in complexity and cryptography
Contemplations on testing graph properties
Studies in complexity and cryptography
Unions of disjoint NP-complete sets
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Journal of the ACM (JACM)
Algorithmic Aspects of Property Testing in the Dense Graphs Model
SIAM Journal on Computing
Quantum interactive proofs with weak error bounds
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On the (im)possibility of obfuscating programs
Journal of the ACM (JACM)
Survey of disjoint NP-pairs and relations to propositional proof systems
Theoretical Computer Science
Theoretical Computer Science
On teaching the basics of complexity theory
Theoretical Computer Science
The complexity of quasigroup isomorphism and the minimum generating set problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On the complexity of entailment in existential conjunctive first-order logic with atomic negation
Information and Computation
Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems
Quantum Information & Computation
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
Stronger methods of making quantum interactive proofs perfectly complete
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Modeling time criticality of information
Information Processing Letters
Unions of Disjoint NP-Complete Sets
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |