NP-complete Problems and Physical Reality

  title={NP-complete Problems and Physical Reality},
  author={Scott Aaronson},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  • Scott Aaronson
  • Published 2005 in Electronic Colloquium on Computational Complexity
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… CONTINUE READING