The complexity of analog computation
Mathematics and Computers in Simulation
Average case complete problems
SIAM Journal on Computing
Does co-NP have short interactive proofs?
Information Processing Letters
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
PP is closed under intersection
Selected papers of the 23rd annual ACM symposium on Theory of computing
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Threshold Computation and Cryptographic Security
SIAM Journal on Computing
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
Complexity and real computation
Complexity and real computation
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Quantum lower bound for the collision problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Minds and Machines
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
Quantum Lower Bounds for the Collision and the Element Distinctness Problems
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
On the Power of Random Access Machines
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
One complexity theorist's view of quantum computing
Theoretical Computer Science - Algorithms,automata, complexity and games
Problems of Information Transmission
Quantum lower bounds by quantum arguments
Journal of Computer and System Sciences - Special issue on STOC 2000
Some NP-complete geometric problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
How Powerful is Adiabatic Quantum Computation?
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
What Is Thought?
The quantum adiabatic optimization algorithm and local minima
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Limitations of Quantum Advice and One-Way Communication
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Limits on efficient computation in the physical world
Limits on efficient computation in the physical world
Algebraic Complexity Theory
Quantum interactive proofs with competing provers
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On quantum versions of record-breaking algorithms for SAT
ACM SIGACT News
Proceedings of the 2006 ACM symposium on Applied computing
Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem
SAB '08 Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats
Solving NP-Complete Problems with Delayed Signals: An Overview of Current Research Directions
OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
Quantum approaches to graph colouring
Theoretical Computer Science
Solving the subset-sum problem with a light-based device
Natural Computing: an international journal
Evolutionary Design of Graph-Based Structures for Optical Computing
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
Computing a Solution for the Subset Sum Problem with a Light Based Device
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
Knot theory, jones polynomial and quantum computing
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
A new light-based solution to the Hamiltonian path problem
Future Generation Computer Systems
The graphs of planar soap bubbles
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
Can NP-complete problems be solved efficiently in the physical universe? I survey proposals including soap bubbles, protein folding, quantum computing, quantum advice, quantum adiabatic algorithms, quantum-mechanical nonlinearities, hidden variables, relativistic time dilation, analog computing, Malament-Hogarth spacetimes, quantum gravity, closed timelike curves, and "anthropic computing." The section on soap bubbles even includes some "experimental" results. While I do not believe that any of the proposals will let us solve NP-complete problems efficiently, I argue that by studying them, we can learn something not only about computation but also about physics.