{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:11:04Z","timestamp":1787497864071,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,9]],"date-time":"2013-01-09T00:00:00Z","timestamp":1357689600000},"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":[[2013,1,9]]},"DOI":"10.1145\/2422436.2422486","type":"proceedings-article","created":{"date-parts":[[2013,1,3]],"date-time":"2013-01-03T07:58:22Z","timestamp":1357199902000},"page":"455-472","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Pseudo-partitions, transversality and locality"],"prefix":"10.1145","author":[{"given":"Ilario","family":"Bonacina","sequence":"first","affiliation":[{"name":"Sapienza Universita di Roma, Rome, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicola","family":"Galesi","sequence":"additional","affiliation":[{"name":"Sapienza Universita di Roma, Rome, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,1,9]]},"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.5555\/874063.875572"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/972639.972645"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.06.025"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02777-2_13"},{"key":"e_1_3_2_1_6_1","volume-title":"Towards understanding and harnessing the potential of clause learning. J. Artif. Intell. Res. (JAIR), 22:319--351","author":"Beame Paul","year":"2004","unstructured":"Paul Beame , Henry A. Kautz , and Ashish Sabharwal . Towards understanding and harnessing the potential of clause learning. J. Artif. Intell. Res. (JAIR), 22:319--351 , 2004 . Paul Beame, Henry A. Kautz, and Ashish Sabharwal. Towards understanding and harnessing the potential of clause learning. J. Artif. Intell. Res. (JAIR), 22:319--351, 2004."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875477"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10089"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796522"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14186-7_4"},{"key":"e_1_3_2_1_12_1","volume-title":"A space hierarchy for k-dnf resolution. Electronic Colloquium on Computational Complexity (ECCC), 16(047)","author":"Ben-Sasson Eli","year":"2009","unstructured":"Eli Ben-Sasson and Jakob Nordstr\u00f6m . A space hierarchy for k-dnf resolution. Electronic Colloquium on Computational Complexity (ECCC), 16(047) , 2009 . Eli Ben-Sasson and Jakob Nordstr\u00f6m. A space hierarchy for k-dnf resolution. Electronic Colloquium on Computational Complexity (ECCC), 16(047), 2009."},{"key":"e_1_3_2_1_13_1","volume-title":"Understanding space in resolution: Optimal lower bounds and exponential trade-offs. Electronic Colloquium on Computational Complexity (ECCC), 16(034)","author":"Ben-Sasson Eli","year":"2009","unstructured":"Eli Ben-Sasson and Jakob Nordstr\u00f6m . Understanding space in resolution: Optimal lower bounds and exponential trade-offs. Electronic Colloquium on Computational Complexity (ECCC), 16(034) , 2009 . Eli Ben-Sasson and Jakob Nordstr\u00f6m. Understanding space in resolution: Optimal lower bounds and exponential trade-offs. Electronic Colloquium on Computational Complexity (ECCC), 16(034), 2009."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375835"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.02.017"},{"key":"e_1_3_2_1_17_1","volume-title":"Maria Luisa Bonet, and Jan Johannsen. Improved separations of regular resolution from clause learning proof systems. Submitted","author":"Buss Sam","year":"2012","unstructured":"Sam Buss , Maria Luisa Bonet, and Jan Johannsen. Improved separations of regular resolution from clause learning proof systems. Submitted , 2012 . Sam Buss, Maria Luisa Bonet, and Jan Johannsen. Improved separations of regular resolution from clause learning proof systems. Submitted, 2012."},{"key":"e_1_3_2_1_18_1","volume-title":"Resolution trees with lemmas - resolution refinements that characterize dll-algorithms with clause learning. Logical Methods in Computer Science, 4,:4:13","author":"Buss Sam","year":"2008","unstructured":"Sam Buss , Jan Hoffman , and Jan Johannsen . Resolution trees with lemmas - resolution refinements that characterize dll-algorithms with clause learning. Logical Methods in Computer Science, 4,:4:13 , 2008 . Sam Buss, Jan Hoffman, and Jan Johannsen. Resolution trees with lemmas - resolution refinements that characterize dll-algorithms with clause learning. Logical Methods in Computer Science, 4,:4:13, 2008."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1726"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294258"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.48016"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237860"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.2307\/2273702"},{"key":"e_1_3_2_1_24_1","volume-title":"An Introduction to Computational Algebraic Geometry and Commutative Algebra","author":"Cox David","year":"2007","unstructured":"David Cox , John Little , and Donal O'Shea . Ideals, Varieties, and Algorithms : An Introduction to Computational Algebraic Geometry and Commutative Algebra , 3 rd edition. Springer , 2007 . David Cox, John Little, and Donal O'Shea. Ideals, Varieties, and Algorithms : An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3rd edition. Springer, 2007.","edition":"3"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/321033.321034"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.04.004"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.2921"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794266766"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2012.27"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-009-9195-5"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1838552.1838556"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000370050024"},{"key":"e_1_3_2_1_34_1","volume-title":"Propositional proof complexity i","author":"Kraj\u00edcek Jan","year":"2009","unstructured":"Jan Kraj\u00edcek . Propositional proof complexity i . 2009 . Jan Kraj\u00edcek. Propositional proof complexity i. 2009."},{"key":"e_1_3_2_1_35_1","first-page":"220","volume-title":"Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design (ICCAD '96)","author":"Joao","year":"1996","unstructured":"Joao P. Marques-Silva and Karem A. Sakallah. Grasp--a new search algorithm for satisfiability . In Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design (ICCAD '96) ,, pages 220 -- 227 , 1996 . Joao P. Marques-Silva and Karem A. Sakallah. Grasp--a new search algorithm for satisfiability. In Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design (ICCAD '96),, pages 220--227, 1996."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132590"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374478"},{"key":"e_1_3_2_1_38_1","first-page":"279","article-title":"Algebraic models of computation and interpolation for algebraic proof systems. DIMACS series","volume":"39","author":"Pudl\u00e1k Pavel","year":"1998","unstructured":"Pavel Pudl\u00e1k and Jir\u00ed Sgall . Algebraic models of computation and interpolation for algebraic proof systems. DIMACS series in Theoretical Computer Science , 39 : 279 -- 296 , 1998 . Pavel Pudl\u00e1k and Jir\u00ed Sgall. Algebraic models of computation and interpolation for algebraic proof systems. DIMACS series in Theoretical Computer Science, 39:279--296, 1998.","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_2_1_39_1","volume-title":"Pseudorandom generators hard for k-dnf resolution and polynomial calculus resolution. Manuscript availbale at author's webpage","author":"Razborov Alexander","year":"2003","unstructured":"Alexander Razborov . Pseudorandom generators hard for k-dnf resolution and polynomial calculus resolution. Manuscript availbale at author's webpage , 2003 . Alexander Razborov. Pseudorandom generators hard for k-dnf resolution and polynomial calculus resolution. Manuscript availbale at author's webpage, 2003."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000370050013"}],"event":{"name":"ITCS '13: Innovations in Theoretical Computer Science","location":"Berkeley California USA","acronym":"ITCS '13","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 4th conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2422436.2422486","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2422436.2422486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:14:15Z","timestamp":1750263255000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2422436.2422486"}},"subtitle":["a combinatorial characterization for the space measure in algebraic proof systems"],"short-title":[],"issued":{"date-parts":[[2013,1,9]]},"references-count":38,"alternative-id":["10.1145\/2422436.2422486","10.1145\/2422436"],"URL":"https:\/\/doi.org\/10.1145\/2422436.2422486","relation":{},"subject":[],"published":{"date-parts":[[2013,1,9]]},"assertion":[{"value":"2013-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}