A fast quantum mechanical algorithm for database search
Lov K. Grover
|
13 |
1996 |
13
1996
|
The complexity of theorem-proving procedures
S. Cook
|
12 |
1971 |
12
1971
|
Fully homomorphic encryption using ideal lattices
Craig Gentry
|
12 |
2009 |
12
2009
|
A new polynomial-time algorithm for linear programming
N. Karmarkar
|
12 |
1984 |
12
1984
|
How to play ANY mental game
Oded Goldreich,
S. Micali,
A. Wigderson
|
12 |
1987 |
12
1987
|
On lattices, learning with errors, random linear codes, and cryptography
O. Regev
|
11 |
2005 |
11
2005
|
A threshold of ln n for approximating set cover (preliminary version)
U. Feige
|
11 |
1996 |
11
1996
|
Matrix multiplication via arithmetic progressions
D. Coppersmith,
S. Winograd
|
11 |
1987 |
11
1987
|
Similarity estimation techniques from rounding algorithms
M. Charikar
|
11 |
2002 |
11
2002
|
Approximation algorithms for combinatorial problems
David S. Johnson
|
11 |
1973 |
11
1973
|
Completeness theorems for non-cryptographic fault-tolerant distributed computation
M. Ben-Or,
S. Goldwasser,
A. Wigderson
|
11 |
1988 |
11
1988
|
The small-world phenomenon: an algorithmic perspective
J. Kleinberg
|
11 |
2000 |
11
2000
|
Quantum complexity theory
Ethan S. Bernstein,
U. Vazirani
|
11 |
1993 |
11
1993
|
The complexity of satisfiability problems
T. Schaefer
|
10 |
1978 |
10
1978
|
Optimization, approximation, and complexity classes
C. Papadimitriou,
M. Yannakakis
|
10 |
1991 |
10
1991
|
A theory of the learnable
L. Valiant
|
10 |
1984 |
10
1984
|
A linear time algorithm for finding tree-decompositions of small treewidth
H. Bodlaender
|
10 |
1993 |
10
1993
|
A new approach to the maximum flow problem
A. Goldberg,
R. Tarjan
|
10 |
1986 |
10
1986
|
