{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:33Z","timestamp":1750306353849,"version":"3.41.0"},"reference-count":3,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T00:00:00Z","timestamp":1474329600000},"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":["XRDS"],"published-print":{"date-parts":[[2016,9,20]]},"abstract":"<jats:p>Which computational problems can be solved in polynomial-time and which cannot? Though seemingly technical, this question has wide-ranging implications and brings us to the heart of both theoretical computer science and modern physics.<\/jats:p>","DOI":"10.1145\/2983539","type":"journal-article","created":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T12:42:46Z","timestamp":1474461766000},"page":"30-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Black holes, quantum mechanics, and the limits of polynomial-time computability"],"prefix":"10.1145","volume":"23","author":[{"given":"Stephen P.","family":"Jordan","sequence":"first","affiliation":[{"name":"National Institute of Standards and Technology (NIST), Gaithersburg, Maryland"}]}],"member":"320","published-online":{"date-parts":[[2016,9,20]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1217069"},{"key":"e_1_2_1_2_1","unstructured":"Fortnow L. What if P = NP?. Computational Complexity. Blog. May 25 2004; http:\/\/blog.computationalcomplexity.org\/2004\/05\/what-if-pnp.html  Fortnow L. What if P = NP?. Computational Complexity. Blog. May 25 2004; http:\/\/blog.computationalcomplexity.org\/2004\/05\/what-if-pnp.html"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Bao N. Bouland A and Jordan S.P. Grover search and the no-signaling principle. 2015. arXiv:1511.00657.  Bao N. Bouland A and Jordan S.P. Grover search and the no-signaling principle . 2015. arXiv:1511.00657.","DOI":"10.1103\/PhysRevLett.117.120501"}],"container-title":["XRDS: Crossroads, The ACM Magazine for Students"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2983539","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2983539","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:01Z","timestamp":1750222561000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2983539"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,20]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,9,20]]}},"alternative-id":["10.1145\/2983539"],"URL":"https:\/\/doi.org\/10.1145\/2983539","relation":{},"ISSN":["1528-4972","1528-4980"],"issn-type":[{"type":"print","value":"1528-4972"},{"type":"electronic","value":"1528-4980"}],"subject":[],"published":{"date-parts":[[2016,9,20]]},"assertion":[{"value":"2016-09-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}