{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T14:19:09Z","timestamp":1791296349714,"version":"4.1.0"},"reference-count":75,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2005,3]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/1052796.1052804","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T19:28:32Z","timestamp":1131391712000},"page":"30-52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":187,"title":["Guest Column: NP-complete problems and physical reality"],"prefix":"10.1145","volume":"36","author":[{"given":"Scott","family":"Aaronson","sequence":"first","affiliation":[{"name":"University of Rochester, Rochester, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2005,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509999"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1009378.1009567"},{"key":"e_1_2_1_3_1","volume-title":"University of California","author":"Aaronson S.","year":"2004"},{"key":"e_1_2_1_4_1","unstructured":"S. Aaronson. Quantum computing and hidden variables. Accepted to Phys. Rev. A. quant-ph\/0408035 and quant-ph\/0408119 2004.  S. Aaronson. Quantum computing and hidden variables. Accepted to Phys. Rev. A. quant-ph\/0408035 and quant-ph\/0408119 2004."},{"key":"e_1_2_1_5_1","unstructured":"S. Aaronson. Quantum computing postselection and probabilistic polynomial-time. Submitted. quant-ph\/0412187 2004.  S. Aaronson. Quantum computing postselection and probabilistic polynomial-time. Submitted. quant-ph\/0412187 2004."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.81.3992"},{"key":"e_1_2_1_7_1","volume-title":"Unpublished","author":"Aharonov D.","year":"2005"},{"key":"e_1_2_1_8_1","first-page":"584","volume-title":"Proc. Intl. Symp. on Theoretical Aspects of Computer Science (STACS)","author":"Allender E.","year":"2004"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1826"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"D. Bacon. Quantum computational complexity in the presence of closed timelike curves. quant-ph\/0309189 2003.  D. Bacon. Quantum computational complexity in the presence of closed timelike curves. quant-ph\/0309189 2003.","DOI":"10.1103\/PhysRevA.70.032309"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204037"},{"key":"e_1_2_1_12_1","volume-title":"Bradford Books","author":"Baum E. B.","year":"2004"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502097"},{"key":"e_1_2_1_14_1","unstructured":"J. E. Beasley. OR-Library (test data sets for operations research problems) 1990. At www.brunel.ac.uk\/depts\/ma\/research\/jeb\/info.html.  J. E. Beasley. OR-Library (test data sets for operations research problems) 1990. At www.brunel.ac.uk\/depts\/ma\/research\/jeb\/info.html."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1017"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevD.23.287"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300933"},{"key":"e_1_2_1_18_1","volume-title":"Springer-Verlag","author":"Blum L.","year":"1997"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRev.85.166"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90232-8"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01397477"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.825"},{"key":"e_1_2_1_24_1","unstructured":"S. Bringsjord and J. Taylor. P=NP. 2004. cs.CC\/0406056.  S. Bringsjord and J. Taylor. P=NP. 2004. cs.CC\/0406056."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025967225931"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1965416"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1088\/0264-9381\/19\/6\/310"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021105915386"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevD.44.3197"},{"key":"e_1_2_1_30_1","volume-title":"Eos, 1995","author":"Egan G.","year":"1992"},{"key":"e_1_2_1_31_1","unstructured":"E. Farhi J. Goldstone and S. Gutmann. Quantum adiabatic evolution algorithms versus simulated annealing. quant-ph\/0201031 2002.  E. Farhi J. Goldstone and S. Gutmann. Quantum adiabatic evolution algorithms versus simulated annealing. quant-ph\/0201031 2002."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1057726"},{"key":"e_1_2_1_33_1","unstructured":"C. Feinstein. Post to comp. theory newsgroup on July 8 2004.  C. Feinstein. Post to comp. theory newsgroup on July 8 2004."},{"key":"e_1_2_1_34_1","unstructured":"C. Feinstein. Evidence that P is not equal to NP. cs.CC\/.0310060 2003.  C. Feinstein. Evidence that P is not equal to NP. cs.CC\/.0310060 2003."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00377-2"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002200200635"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002200200645"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/800113.803626"},{"key":"e_1_2_1_39_1","volume-title":"Freeman","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_40_1","doi-asserted-by":"crossref","unstructured":"W. Gasarch. The P=?NP poll. SIGACT News 33(2):34--47 June 2002.  W. Gasarch. The P=?NP poll. SIGACT News 33(2):34--47 June 2002.","DOI":"10.1145\/564585.564599"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/0375-9601(90)90786-N"},{"issue":"026","key":"e_1_2_1_42_1","first-page":"0311269","article-title":"Comment on \"The black hole final state","volume":"0403","author":"Gottesman D.","year":"2004","journal-title":"J. High Energy Phys."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_50"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240467"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1086\/psaprocbienmeetp.1994.1.193018"},{"key":"e_1_2_1_47_1","volume-title":"Helix Books","author":"Horgan J.","year":"1997"},{"issue":"008","key":"e_1_2_1_48_1","first-page":"0310281","article-title":"The black hole final state","volume":"0402","author":"Horowitz G.","year":"2004","journal-title":"J. High Energy Phys."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258590"},{"key":"e_1_2_1_50_1","unstructured":"Clay Math Institute. Millennium prize problems 2000. www.claymath.org\/millennium\/.  Clay Math Institute. Millennium prize problems 2000. www.claymath.org\/millennium\/."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335314"},{"key":"e_1_2_1_52_1","first-page":"191","article-title":"Turing machines that take advice","volume":"28","author":"Karp R. M.","year":"1982","journal-title":"Enseign. Math."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025780028846"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215020"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023634616182"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_83"},{"key":"e_1_2_1_57_1","volume-title":"Cambridge University Press","author":"Nielsen M.","year":"2000"},{"key":"e_1_2_1_58_1","volume-title":"Quantum Theory and Beyond","author":"Penrose R.","year":"1971"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.66.397"},{"key":"e_1_2_1_60_1","volume-title":"May 10, 2002.","author":"Preskill J."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1494"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007428"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.5555\/646233.682381"},{"key":"e_1_2_1_64_1","first-page":"513","volume-title":"Proc. IEEE FOCS","author":"Shi Y.","year":"2002"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365701"},{"key":"e_1_2_1_67_1","volume-title":"Proceedings of Discussion Workshop on Black Holes","author":"Singh T. P.","year":"1997"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129771"},{"key":"e_1_2_1_69_1","volume-title":"Time and the Instant. Clinamen Press","author":"Smolin L.","year":"2000"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/602220.602223"},{"key":"e_1_2_1_71_1","volume-title":"International School for Advanced Studies","author":"Valentini A.","year":"1992"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12043-002-0117-1"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875560"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-4754(86)90105-9"},{"key":"e_1_2_1_75_1","doi-asserted-by":"crossref","unstructured":"D. L. Vertigan and D. J. A. Welsh. The computational complexity of the Tutte plane: the bipartite case. Combinatorics Probability and Computing 1(2) 1992.  D. L. Vertigan and D. J. A. Welsh. The computational complexity of the Tutte plane: the bipartite case. Combinatorics Probability and Computing 1(2) 1992.","DOI":"10.1017\/S0963548300000195"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.62.485"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1052796.1052804","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1052796.1052804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:42Z","timestamp":1750262862000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1052796.1052804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":75,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["10.1145\/1052796.1052804"],"URL":"https:\/\/doi.org\/10.1145\/1052796.1052804","relation":{},"ISSN":["0163-5700"],"issn-type":[{"value":"0163-5700","type":"print"}],"subject":[],"published":{"date-parts":[[2005,3]]},"assertion":[{"value":"2005-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}