|
556
|
A new method for solving hard satisfiability problems
– Selman, Levesque, et al.
- 1992
|
|
496
|
The complexity of theorem-proving procedures
– Cook
- 1971
|
|
408
|
A fast quantum mechanical algorithm for database search
– Grover
- 1996
|
|
399
|
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
– Shor
- 1996
|
|
324
|
Quantum theory, the Church-Turing principle and the universal quantum computer
– Deutsch
- 1985
|
|
303
|
On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines
– Blum, Shub, et al.
- 1989
|
|
227
|
On the power of quantum computation
– Simon
|
|
191
|
Strengths and weaknesses of quantum computing
– Bennett, Bernstein, et al.
- 1997
|
|
189
|
The Emperor's New Mind
– Penrose
- 1989
|
|
188
|
Local Search Strategies for Satisfiability Testing
– Selman, Kautz, et al.
- 1995
|
|
187
|
Rapid solution of problems by quantum computation
– Deutsch, Jozsa
- 1992
|
|
86
|
Networks of Spiking Neurons: The Third Generation of Neural Network Models. Neural Networks 10(9):1659
– Maass
- 1997
|
|
71
|
Protein folding in the hydrophobic-hydrophilic (HP) model is NPcomplete
– Berger, Leighton
- 1998
|
|
51
|
A deterministic (2 − 2/(k + 1)) n algorithm for k–SAT based on local search. Theoretical Computer Science
– Dantsin, Goerdt, et al.
- 2002
|
|
50
|
New methods for 3-SAT decision and worst-case analysis
– Kullmann
- 1999
|
|
47
|
Grover's quantum searching algorithm is optimal
– Zalka
- 1997
|
|
34
|
Computers and intractability: a guide to the theory of NP-completeness
– MR, DS
- 1979
|
|
31
|
A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality
– Aspvall, Shiloach
- 1980
|
|
30
|
Minesweeper is NP-complete
– Kaye
- 2000
|
|
21
|
Can’t get no satisfaction
– Hayes
- 1997
|
|
18
|
Analog computation with dynamical systems
– Siegelmann, Fishman
- 1998
|
|
16
|
Mathematical theory of the differential analyser
– Shannon
- 1941
|
|
15
|
Quantum Mechanical Hamiltonian Models of Discrete Processes That Erase Their Own Histories: Application to Turing Machines
– Benioff
- 1982
|
|
15
|
A probabilistic algorithm for k-SAT based on limited local search and restart
– Schöning
- 2002
|
|
11
|
An Analog Analogue of a Digital Quantum Computation
– Farhi, Gutmann
- 1998
|
|
11
|
Modelling Brain Function
– DJ
- 1989
|
|
10
|
The differential analyzer: a new machine for solving differential equations
– Bush
- 1931
|
|
8
|
An Approximate Fourier Transform Useful
– Coppersmith
- 1994
|
|
7
|
time, parallelism and noise requirements for reliable quantum computing
– Steane, “Space
- 1998
|
|
7
|
Quantum amplitude amplification and estimation. In: Quantum Computation and Quantum Information: A Millennium Volume
– Brassard, Høyer, et al.
|
|
6
|
The dynamics of impossible devices
– Stewart
- 1991
|
|
6
|
Quantum search without entanglement,” Phys
– Lloyd
- 1999
|
|
6
|
Parallel hybrid method for SAT that couples genetic algorithms and local search
– Folino, Pizzuti, et al.
- 2001
|
|
5
|
Clause Computation with DNA Molecules
– Kobayashi, Horn
- 1999
|
|
3
|
et al., “Tight Bounds on Quantum Searching,” Fortschritte der Physik
– Boyer
- 1998
|
|
3
|
Undecidability and Intractability in Theoretical
– Wolfram
- 1985
|
|
3
|
Computational Complexity for Physicists. Computing
– Mertens
- 2002
|
|
3
|
Good quantum error-correcting codes exist
– AR, PW
- 1996
|
|
2
|
Quantum computation course lecture notes
– Preskill
- 1999
|
|
2
|
CR McGeoch LA and Schevon C, Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning
– DS, Aragon
- 1991
|
|
2
|
A backtracking survey propagation algorithm for K-satisfiability
– Parisi
- 2003
|
|
2
|
Parisi G and Zecchina R, Analytic and Algorithmic
– Mézard
|
|
2
|
From coupled pendulums to quantum search
– LK, Sengupta
|
|
2
|
A public-key cryptosystem based on algebraic coding theory
– RJ
- 1978
|
|
1
|
et al., Quantum lower bounds by polynomials
– Beals, Buhrman, et al.
- 2001
|
|
1
|
Does a Single Zealot Affect an Infinite Group of Voters?, Phys
– Mobilia
- 2003
|
|
1
|
Molecular Computation of Solutions to
– LM
- 1994
|
|
1
|
Exact integer algorithm for the 2d ±J Ising spin glass, Phys
– LK, Kardar
- 1993
|
|
1
|
Robust quantum computation by simulation
– Lloyd, Rahn, et al.
|
|
1
|
Simulating physics with computers, Int
– RP
- 1982
|
