{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:37:04Z","timestamp":1750307824826,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:00:00Z","timestamp":1210982400000},"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":[[2008,5,17]]},"DOI":"10.1145\/1374376.1374478","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T16:50:20Z","timestamp":1211993420000},"page":"701-710","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Towards an optimal separation of space and length in resolution"],"prefix":"10.1145","author":[{"given":"Jakob","family":"Nordstr\u00f6m","sequence":"first","affiliation":[{"name":"Royal Institute of Technology (KTH), Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"H\u00e5stad","sequence":"additional","affiliation":[{"name":"Royal Institute of Technology (KTH), Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700366735"},{"key":"e_1_3_2_1_2_1","first-page":"239","volume-title":"Proc. 18th IEEE Annual Conference on Computational Complexity (CCC '03)","author":"Atserias A.","year":"2003","unstructured":"A. Atserias and V. Dalmau . A combinatorical characterization of resolution width . In Proc. 18th IEEE Annual Conference on Computational Complexity (CCC '03) , pages 239 -- 247 , 2003 .]] A. Atserias and V. Dalmau. A combinatorical characterization of resolution width. In Proc. 18th IEEE Annual Conference on Computational Complexity (CCC '03), pages 239--247, 2003.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1090\/pcms\/010\/07"},{"key":"e_1_3_2_1_4_1","first-page":"94","volume-title":"Proc. 18th International Joint Conference in Artificial Intelligence (IJCAI '03)","author":"Beame P.","year":"2003","unstructured":"P. Beame , H. Kautz , and A. Sabharwal . Understanding the power of clause learning . In Proc. 18th International Joint Conference in Artificial Intelligence (IJCAI '03) , pages 94 -- 99 , 2003 .]] P. Beame, H. Kautz, and A. Sabharwal. Understanding the power of clause learning. In Proc. 18th International Joint Conference in Artificial Intelligence (IJCAI '03), pages 94--99, 2003.]]"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509975"},{"key":"e_1_3_2_1_6_1","volume-title":"Personal communication","author":"Ben-Sasson E.","year":"2007","unstructured":"E. Ben-Sasson . Personal communication , 2007 .]] E. Ben-Sasson. Personal communication, 2007.]]"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10089"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-004-0036-5"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375835"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000370100000"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.48016"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.2307\/2273702"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80048-7"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/321033.321034"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.2921"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(03)00345-4"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90144-6"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.25"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/322003.322015"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.10.004"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214115"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132590"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/321250.321253"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24605-3_19"},{"key":"e_1_3_2_1_30_1","unstructured":"The international SAT Competitions web page. http:\/\/www.satcompetition.org.]]  The international SAT Competitions web page. http:\/\/www.satcompetition.org.]]"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1203350879"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/647849.737085"},{"key":"e_1_3_2_1_33_1","first-page":"86","article-title":"Space and width in propositional resolution","volume":"83","author":"Tor\u00e1n J.","year":"2004","unstructured":"J. Tor\u00e1n . Space and width in propositional resolution . Bull. EATCS , 83 : 86 -- 104 , 2004 .]] J. Tor\u00e1n. Space and width in propositional resolution. Bull. EATCS, 83:86--104, 2004.]]","journal-title":"Bull. EATCS"},{"key":"e_1_3_2_1_34_1","first-page":"115","volume-title":"Structures in Constructive Mathematics and Mathematical Logic, Part II","author":"Tseitin G.","year":"1968","unstructured":"G. Tseitin . On the complexity of derivation in propositional calculus . In A. O. Silenko, editor, Structures in Constructive Mathematics and Mathematical Logic, Part II , pages 115 -- 125 . Consultants Bureau , New York-London, 1968 .]] G. Tseitin. On the complexity of derivation in propositional calculus. In A. O. Silenko, editor, Structures in Constructive Mathematics and Mathematical Logic, Part II, pages 115--125. Consultants Bureau, New York-London, 1968.]]"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/7531.8928"}],"event":{"name":"STOC '08: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Victoria British Columbia Canada","acronym":"STOC '08"},"container-title":["Proceedings of the fortieth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374478","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374376.1374478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:50Z","timestamp":1750255070000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":32,"alternative-id":["10.1145\/1374376.1374478","10.1145\/1374376"],"URL":"https:\/\/doi.org\/10.1145\/1374376.1374478","relation":{},"subject":[],"published":{"date-parts":[[2008,5,17]]},"assertion":[{"value":"2008-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}