|
74
|
General oracle and oracle classes
– M Blum, R Impagliazzo
|
|
129
|
Complexity measures for public-key cryptosystems
– Joachim Grollmann, Lehrstuhl Informatik I
- 1988
|
|
734
|
A Fast Quantum Mechanical Algorithm for Database Search
– Lov K. Grover
- 1996
|
|
295
|
Strengths and Weaknesses of quantum computing
– Charles H. Bennett, Ethan Bernstein, Gilles Brassard, Umesh Vazirani
- 1997
|
|
88
|
Complexity Limitations on Quantum Computation
– Lance Fortnow, John Rogers
- 1997
|
|
34
|
Decision trees and downward closures
– R Impagliazzo, M Naor
- 1988
|
|
136
|
A complexity theoretic approach to randomness
– M Sipser
- 1983
|
|
76
|
CREW PRAMs and decision trees
– N Nisan
- 1991
|
|
18
|
One-way functions and the nonisomorphism of NP-complete sets
– J Hartmanis, L Hemachandra
- 1991
|
|
22
|
Separability and One-way Functions
– Lance Fortnow , John Rogers
- 2000
|
|
26
|
Oracles for structural properties: The isomorphism problem and public-key cryptography
– S Homer, A L Selman
- 1992
|
|
3376
|
Introduction to Automata Theory Languages and Computation. 2nd edition. Addison-Wesley Publishing Company, 2000. de
– J Hopcroft, J Ullman
- 2004
|
|
268
|
Algebraic Methods for Interactive Proof Systems
– Carsten Lund, Lance Fortnow, Howard Karloff, Noam Nisan
- 1990
|
|
447
|
Quantum complexity theory
– Ethan Bernstein, Umesh Vazirani
- 1993
|
|
337
|
On the power of quantum computation
– Daniel R. Simon
- 1997
|
|
756
|
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
– Peter W. Shor
- 1997
|
|
236
|
Quantum Lower Bounds by Polynomials
– Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
- 1998
|
|
126
|
On the degree of Boolean functions as real polynomials
– Noam Nisan, Mario Szegedy
- 1994
|
|
76
|
BPP and the polynomial hierarchy
– C Lautemann
- 1983
|
