{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T20:15:22Z","timestamp":1793132122117,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,5,21]],"date-time":"2006-05-21T00:00:00Z","timestamp":1148169600000},"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":[[2006,5,21]]},"DOI":"10.1145\/1132516.1132590","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"507-516","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Narrow proofs may be spacious"],"prefix":"10.1145","author":[{"given":"Jakob","family":"Nordstr\u00f6m","sequence":"first","affiliation":[{"name":"Royal Institute of Technology (KTH), Stockholm, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2006,5,21]]},"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","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509974"},{"key":"e_1_3_2_1_3_1","first-page":"239","volume-title":"Proceedings 18th IEEE Annual Conference on Conference on Computational Complexity (CCC '03)","author":"Atserias A.","year":"2003","unstructured":"A. Atserias and V. Dalmau . A combinatorical characterization of resolution width . In Proceedings 18th IEEE Annual Conference on Conference on Computational Complexity (CCC '03) , pages 239 -- 247 , July 2003 .]] A. Atserias and V. Dalmau. A combinatorical characterization of resolution width. In Proceedings 18th IEEE Annual Conference on Conference on Computational Complexity (CCC '03), pages 239--247, July 2003.]]"},{"key":"e_1_3_2_1_4_1","first-page":"190","article-title":"Minimally unsatisfiable CNF formulas","volume":"74","author":"Baumer S.","year":"2001","unstructured":"S. Baumer , J. L. Esteban , and J. Tor\u00e1n . Minimally unsatisfiable CNF formulas . Bulletin of the European Association for Theoretical Computer Science , 74 : 190 -- 192 , June 2001 .]] S. Baumer, J. L. Esteban, and J. Tor\u00e1n. Minimally unsatisfiable CNF formulas. Bulletin of the European Association for Theoretical Computer Science, 74:190--192, June 2001.]]","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369156"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509975"},{"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.1137\/S0097539799352474"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796523"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/788023.789053"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.48016"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.2307\/2273702"},{"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.1016\/j.tcs.2004.04.004"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.2921"},{"key":"e_1_3_2_1_20_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.1137\/0206031"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90144-6"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214115"},{"key":"e_1_3_2_1_25_1","volume-title":"Propositional Logic: Deduction and Algorithms","author":"Kleine B\u00fcning H.","year":"1999","unstructured":"H. Kleine B\u00fcning and T. Letterman . Propositional Logic: Deduction and Algorithms . Cambridge University Press , 1999 .]] H. Kleine B\u00fcning and T. Letterman. Propositional Logic: Deduction and Algorithms. Cambridge University Press, 1999.]]"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.4064\/fm170-1-8"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804420"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(80)90136-2"},{"key":"e_1_3_2_1_30_1","volume-title":"Technical Report RC8258","author":"Pippenger N.","year":"1980","unstructured":"N. Pippenger . Pebbling. Technical Report RC8258 , IBM Watson Research Center , 1980 .]] N. Pippenger. Pebbling. Technical Report RC8258, IBM Watson Research Center, 1980.]]"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/972639.972640"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/321250.321253"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/647849.737085"},{"key":"e_1_3_2_1_34_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 . Bulletin of the European Association for Theoretical Computer Science , 83 : 86 -- 104 , June 2004 .]] J. Tor\u00e1n. Space and width in propositional resolution. Bulletin of the European Association for Theoretical Computer Science, 83:86--104, June 2004.]]","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"e_1_3_2_1_35_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_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/7531.8928"}],"event":{"name":"STOC06: Symposium on Theory of Computing","location":"Seattle WA USA","acronym":"STOC06","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132590","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1132516.1132590","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:13Z","timestamp":1750259173000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132590"}},"subtitle":["separating space and width in resolution"],"short-title":[],"issued":{"date-parts":[[2006,5,21]]},"references-count":33,"alternative-id":["10.1145\/1132516.1132590","10.1145\/1132516"],"URL":"https:\/\/doi.org\/10.1145\/1132516.1132590","relation":{},"subject":[],"published":{"date-parts":[[2006,5,21]]},"assertion":[{"value":"2006-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}