{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T23:35:29Z","timestamp":1785800129316,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642207112","type":"print"},{"value":"9783642207129","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20712-9_1","type":"book-chapter","created":{"date-parts":[[2011,6,11]],"date-time":"2011-06-11T00:05:22Z","timestamp":1307750722000},"page":"1-14","source":"Crossref","is-referenced-by-count":4,"title":["The Equivalence of Sampling and Searching"],"prefix":"10.1007","author":[{"given":"Scott","family":"Aaronson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Aaronson, S., Arkhipov, A.: The computational complexity of linear optics. In: Proc. ACM STOC, To appear. ECCC TR10-170, arXiv:1011.3245 ( to appear, 2011)"},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/1461928.1461951","volume":"52","author":"C. Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. ACM Commun.\u00a052(2), 89\u201397 (2009); Earlier version in Proceedings of STOC 2006","journal-title":"ACM Commun."},{"key":"1_CR3","unstructured":"G\u00e1cs, P.: Lecture notes on descriptional complexity and randomness (2010), \n                  \n                    www.cs.bu.edu\/~gacs\/papers\/ait-notes.pdf"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: On promise problems: a survey. In: Essays in Memory of Shimon Even, pp. 254\u2013290, ECCC TR05-018 (2006)","DOI":"10.1007\/11685654_12"},{"key":"1_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M. Li","year":"2008","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer, Heidelberg (2008)","edition":"3"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Rao, A.: Parallel repetition in projection games and a concentration bound. In: Proc. ACM STOC, pp. 1\u201310, ECCC TR08-013 (2008)","DOI":"10.1145\/1374376.1374378"},{"issue":"5","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput.\u00a026(5), 1484\u20131509 (1997); Earlier version in IEEE FOCS 1994. quant-ph\/9508027","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20712-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T12:23:18Z","timestamp":1553775798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20712-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207112","9783642207129"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20712-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}