{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:44:07Z","timestamp":1781077447245,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"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":[],"published-print":{"date-parts":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806723","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"231-240","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["Improving exhaustive search implies superpolynomial lower bounds"],"prefix":"10.1145","author":[{"given":"Ryan","family":"Williams","sequence":"first","affiliation":[{"name":"IBM Almaden Research Center, San Jose, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(94)00034-Z"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1540612"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01275486"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/646978.711702"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2005.27"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000085"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/792763.793359"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222038"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00074-6"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793258295"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2006.6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11269-0_6"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/070687153"},{"key":"e_1_3_2_1_14_1","volume-title":"Handbook of Satisfiability","author":"Dantsin E.","year":"2008","unstructured":"E. Dantsin and E. A. Hirsch . Worst-case upper bounds . In Handbook of Satisfiability , A. Biere, M. Heule, H. van Maaren and T. Walsh (eds.), 341--362, 2008 . E. Dantsin and E. A. Hirsch. Worst-case upper bounds. In Handbook of Satisfiability, A. Biere, M. Heule, H. van Maaren and T. Walsh (eds.), 341--362, 2008."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2464827"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73055"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.06.003"},{"key":"e_1_3_2_1_18_1","volume-title":"Parameterized complexity theory","author":"Flum J.","year":"2006","unstructured":"J. Flum and M. Grohe . Parameterized complexity theory . Springer , 2006 . J. Flum and M. Grohe. Parameterized complexity theory. Springer, 2006."},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. IEEE Conf. on Computational Complexity, 28--34","author":"Fortnow L.","year":"2001","unstructured":"L. Fortnow . Comparing notions of full derandomization . In Proc. IEEE Conf. on Computational Complexity, 28--34 , 2001 . L. Fortnow. Comparing notions of full derandomization. In Proc. IEEE Conf. on Computational Complexity, 28--34, 2001."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1101821.1101822"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(95)00022-2"},{"key":"e_1_3_2_1_22_1","first-page":"108","article-title":"Nearly linear time. Logic at Botik '89","volume":"363","author":"Gurevich Y.","year":"1989","unstructured":"Y. Gurevich and S. Shelah . Nearly linear time. Logic at Botik '89 , Springer-Verlag LNCS 363 , 108 -- 118 , 1989 . Y. Gurevich and S. Shelah. Nearly linear time. Logic at Botik '89, Springer-Verlag LNCS 363, 108--118, 1989.","journal-title":"Springer-Verlag LNCS"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129771"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794261556"},{"key":"e_1_3_2_1_25_1","unstructured":"R. Impagliazzo personal communication.  R. Impagliazzo personal communication."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00024-7"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1727"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1774"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335314"},{"key":"e_1_3_2_1_30_1","volume-title":"TR00-034","author":"Kabanets V.","year":"2000","unstructured":"V. Kabanets , C. Rackoff , and S. A. Cook . Efficiently approximable real-valued functions. Electronic Colloquium on Computational Complexity , TR00-034 , 2000 . V. Kabanets, C. Rackoff, and S. A. Cook. Efficiently approximable real-valued functions. Electronic Colloquium on Computational Complexity, TR00-034, 2000."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-004-0182-6"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744432"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00830-7"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804678"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803407"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700389652"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.16"},{"key":"e_1_3_2_1_38_1","unstructured":"R. J. Lipton. Simulation of nondeterministic machines. Weblog post available at http:\/\/rjlipton.wordpress.com\/2009\/05\/11\/simulation-of-nondeterministic-machines\/  R. J. Lipton. Simulation of nondeterministic machines. Weblog post available at http:\/\/rjlipton.wordpress.com\/2009\/05\/11\/simulation-of-nondeterministic-machines\/"},{"key":"e_1_3_2_1_39_1","unstructured":"R. J. Lipton. An approach to the P=NP question? Weblog post available at http:\/\/rjlipton.wordpress.com\/2009\/10\/02\/an-approach-to-the-pnp-question\/  R. J. Lipton. An approach to the P=NP question? Weblog post available at http:\/\/rjlipton.wordpress.com\/2009\/10\/02\/an-approach-to-the-pnp-question\/"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940873"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703438629"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000012"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.10"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.86"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/322123.322138"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/322047.322061"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1767"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/1789694.1789712"},{"key":"e_1_3_2_1_49_1","volume-title":"Studies in Constr. Math. and Math. Logic","author":"Tseitin G.","year":"1968","unstructured":"G. Tseitin . On the complexity of derivation in propositional calculus . Studies in Constr. Math. and Math. Logic , 1968 . G. Tseitin. On the complexity of derivation in propositional calculus. Studies in Constr. Math. and Math. Logic, 1968."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-008-0248-y"},{"key":"e_1_3_2_1_51_1","volume-title":"Proc. Symposium on Theoretical Aspects of Computer Science","author":"Williams R.","year":"2010","unstructured":"R. Williams . Alternation-trading proofs, linear programming , and lower bounds . In Proc. Symposium on Theoretical Aspects of Computer Science , 2010 . R. Williams. Alternation-trading proofs, linear programming, and lower bounds. In Proc. Symposium on Theoretical Aspects of Computer Science, 2010."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90015-4"}],"event":{"name":"STOC'10: Symposium on Theory of Computing","location":"Cambridge Massachusetts USA","acronym":"STOC'10","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806723","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806723","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806723"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":52,"alternative-id":["10.1145\/1806689.1806723","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806723","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}