{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:01Z","timestamp":1750307041074,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"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":[[2012,5,19]]},"DOI":"10.1145\/2213977.2213999","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"213-232","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Time-space tradeoffs in resolution"],"prefix":"10.1145","author":[{"given":"Paul","family":"Beame","sequence":"first","affiliation":[{"name":"University of Washington, Seattle, WA, USA"}]},{"given":"Christopher","family":"Beck","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}]},{"given":"Russell","family":"Impagliazzo","sequence":"additional","affiliation":[{"name":"University of California San Diego & Institute for Advanced Study, San Diego, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652190"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214424"},{"key":"e_1_3_2_2_4_1","volume-title":"Solving #sat and Bayesian inference with backtracking search. jair, 34:391--442","author":"Bacchus Fahiem","year":"2009","unstructured":"Fahiem Bacchus , Shannon Dalmao , and Toniann Pitassi . Solving #sat and Bayesian inference with backtracking search. jair, 34:391--442 , 2009 . Fahiem Bacchus, Shannon Dalmao, and Toniann Pitassi. Solving #sat and Bayesian inference with backtracking search. jair, 34:391--442, 2009."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875477"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-004-0036-5"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.42"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301392"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.03.011"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1764891.1764963"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90054-8"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90144-6"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.25"},{"key":"e_1_3_2_2_17_1","volume-title":"Propositional Logic and Complexity Theory","author":"Kraj\u00edcek J.","year":"1996","unstructured":"J. Kraj\u00edcek . Bounded Arithmetic , Propositional Logic and Complexity Theory . Cambridge University Press , 1996 . J. Kraj\u00edcek. Bounded Arithmetic, Propositional Logic and Complexity Theory. Cambridge University Press, 1996."},{"key":"e_1_3_2_2_18_1","first-page":"220","volume-title":"Proceedings of the International Conference on Computer-Aided Design","author":"Joao","year":"1996","unstructured":"Joao P. Marques-Silva and Karem A. Sakallah. Grasp -- a new search algorithm for satisfiability . In Proceedings of the International Conference on Computer-Aided Design , pages 220 -- 227 , San Jose, CA , November 1996 . ACM\/IEEE. Joao P. Marques-Silva and Karem A. Sakallah. Grasp -- a new search algorithm for satisfiability. In Proceedings of the International Conference on Computer-Aided Design, pages 220--227, San Jose, CA, November 1996. ACM\/IEEE."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/060668250"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.06.006"},{"key":"e_1_3_2_2_21_1","volume-title":"Logical Methods in Computer Science","author":"Nordstr\u00f6m J.","year":"2011","unstructured":"J. Nordstr\u00f6m . Pebble games, proof complexity, and time-space trade-offs . Logical Methods in Computer Science , 2011 . To appear. J. Nordstr\u00f6m. Pebble games, proof complexity, and time-space trade-offs. Logical Methods in Computer Science, 2011. To appear."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374478"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289150"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380821"},{"key":"e_1_3_2_2_25_1","volume-title":"June-July:541--500","author":"Pudl\u00e1k Pavel","year":"2000","unstructured":"Pavel Pudl\u00e1k . Proofs as games. American Math. Monthly , June-July:541--500 , 2000 . Pavel Pudl\u00e1k. Proofs as games. American Math. Monthly, June-July:541--500, 2000."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/338219.338244"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90056-2"},{"key":"e_1_3_2_2_28_1","volume-title":"Studies in Constructive Mathematics and Mathematical Logic, Part II.","author":"Tseitin G. S.","year":"1968","unstructured":"G. S. Tseitin . On the complexity of derivation in the propositional calculus. In A. O. Slisenko, editor, Studies in Constructive Mathematics and Mathematical Logic, Part II. 1968 . G. S. Tseitin. On the complexity of derivation in the propositional calculus. In A. O. Slisenko, editor, Studies in Constructive Mathematics and Mathematical Logic, Part II. 1968."},{"key":"e_1_3_2_2_29_1","first-page":"279","volume-title":"Proceedings of the International Conference on Computer-Aided Design","author":"Zhang Lintao","year":"2001","unstructured":"Lintao Zhang , Conor F. Madigan , Matthew H. Moskewicz , and Sharad Malik . Efficient conflict driven learning in a boolean satisfiability solver . In Proceedings of the International Conference on Computer-Aided Design , pages 279 -- 285 , San Jose, CA , November 2001 . ACM\/IEEE. Lintao Zhang, Conor F. Madigan, Matthew H. Moskewicz, and Sharad Malik. Efficient conflict driven learning in a boolean satisfiability solver. In Proceedings of the International Conference on Computer-Aided Design, pages 279--285, San Jose, CA, November 2001. ACM\/IEEE."}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2213999","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2213999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2213999"}},"subtitle":["superpolynomial lower bounds for superlinear space"],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":25,"alternative-id":["10.1145\/2213977.2213999","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2213999","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}