The complexity of promise problems with applications to public-key cryptography
Information and Control
NP is as easy as detecting unique solutions
Theoretical Computer Science
The complexity of perfect zero-knowledge
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The monotone circuit complexity of Boolean functions
Combinatorica
Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
Monotone circuits for connectivity require super-logarithmic depth
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Statistical zero-knowledge languages can be recognized in two rounds
Journal of Computer and System Sciences
Journal of the ACM (JACM)
On the distributional complexity of disjointness
Theoretical Computer Science
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A sublinear bipartiteness tester for bounded degree graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On relationships between statistical zero-knowledge proofs
Journal of Computer and System Sciences
On the limits of nonapproximability of lattice problems
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
A note on the non-NP-hardness of approximate lattice problems under general Cook reductions
Information Processing Letters
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
Cryptocomplexity and NP-Completeness
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Classical and Quantum Computation
Classical and Quantum Computation
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A study of statistical zero-knowledge proofs
A study of statistical zero-knowledge proofs
An Unconditional Study of Computational Zero Knowledge
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Hierarchy Theorems for Probabilistic Polynomial Time
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Two theorems on random polynomial time
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations 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
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
The equivalence of sampling and searching
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Introduction to 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
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
Approximating the min-max (regret) selecting items problem
Information Processing Letters
Unions of Disjoint NP-Complete Sets
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 5.23 |
The notion of promise problems was introduced and initially studied by Even, Selman and Yacobi (Inform. and Control, Vol. 61, pages 159–173, 1984). In this article we survey some of the applications that this notion has found in the twenty years that elapsed. These include the notion of “unique solutions”, the formulation of “gap problems” as capturing various approximation tasks, the identification of complete problems (especially for the class ${\cal SZK}$), the indication of separations between certain computational resources, and the enabling of presentations that better distill the essence of various proofs.