{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:10:10Z","timestamp":1750223410160,"version":"3.41.0"},"reference-count":61,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2016,5,18]],"date-time":"2016-05-18T00:00:00Z","timestamp":1463529600000},"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":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2016,7,22]]},"abstract":"<jats:p>\n            We prove that there are 3-CNF formulas over\n            <jats:italic>n<\/jats:italic>\n            variables that can be refuted in resolution in width\n            <jats:italic>w<\/jats:italic>\n            but require resolution proofs of size\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>\n              \u03a9(\n              <jats:italic>w<\/jats:italic>\n              )\n            <\/jats:sup>\n            . This shows that the simple counting argument that any formula refutable in width\n            <jats:italic>w<\/jats:italic>\n            must have a proof in size\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>\n              O(\n              <jats:italic>w<\/jats:italic>\n              )\n            <\/jats:sup>\n            is essentially tight. Moreover, our lower bound generalizes to polynomial calculus resolution and Sherali-Adams, implying that the corresponding size upper bounds in terms of degree and rank are tight as well. The lower bound does not extend all the way to Lasserre, however, since we show that there the formulas we study have proofs of constant rank and size polynomial in both\n            <jats:italic>n<\/jats:italic>\n            and\n            <jats:italic>w<\/jats:italic>\n            .\n          <\/jats:p>","DOI":"10.1145\/2898435","type":"journal-article","created":{"date-parts":[[2016,5,18]],"date-time":"2016-05-18T14:28:02Z","timestamp":1463581682000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Narrow Proofs May Be Maximally Long"],"prefix":"10.1145","volume":"17","author":[{"given":"Albert","family":"Atserias","sequence":"first","affiliation":[{"name":"Universitat Polit\u00e8cnica de Catalunya, Catalonia, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Lauria","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakob","family":"Nordstr\u00f6m","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,5,18]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00395-5"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700366735"},{"key":"e_1_2_1_3_1","first-page":"18","article-title":"Lower bounds for polynomial calculus: Non-binomial case","volume":"242","author":"Alekhnovich Michael","year":"2003","journal-title":"Proc. Steklov Institute of Mathematics"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.06.025"},{"volume-title":"Johannes Klaus Fichte, and Marc Thurley","year":"2011","author":"Atserias Albert","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2014.36"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2013.20"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214006"},{"volume-title":"Proceedings of the 14th National Conference on Artificial Intelligence (AAAI\u201997)","author":"Bayardo Roberto J.","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","first-page":"66","article-title":"Propositional proof complexity: Past, present, and future","volume":"65","author":"Beame Paul","year":"1998","journal-title":"Bulletin of the European Association for Theoretical Computer Science."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213999"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1328865.1328873"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488711"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/080723880"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10089"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.42"},{"volume-title":"Proceedings of the 2nd Symposium on Innovations in Computer Science (ICS\u201911)","year":"2011","author":"Ben-Sasson Eli","key":"e_1_2_1_17_1"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375835"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.48"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499937.2499941"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2355580.2355582"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699438"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.74"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000370100000"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.02.017"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2008.11.043"},{"volume-title":"Handbook on Semidefinite, Conic and Polynomial Optimization, Miguel F","author":"Chlamt\u00e1\u010d Eden","key":"e_1_2_1_29_1"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90167-2"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.48016"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237860"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.2307\/2273702"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(87)90039-4"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2013.10.009"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.01.002"},{"volume-title":"Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201901)","author":"Dantchev Stefan S.","key":"e_1_2_1_37_1"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.2921"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39206-1_37"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/120895950"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744431"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206031"},{"volume-title":"Recent Advances in Mathematical Programming","author":"Gomory Ralph E.","key":"e_1_2_1_43_1"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00157-2"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.17323\/1609-4514-2002-2-4-647-679"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(01)00055-0"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591838"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90144-6"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000370050024"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.5555\/645590.757890"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.28.3.470.16391"},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the 30th Annual Computational Complexity Conference (CCC\u201915) (Leibniz International Proceedings in Informatics (LIPIcs))","volume":"33","author":"Lauria Massimo","year":"2015"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1137\/0801013"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.769433"},{"key":"e_1_2_1_56_1","volume-title":"Proceedings of the 30th Annual Computational Complexity Conference (CCC\u201915) (Leibniz International Proceedings in Informatics (LIPIcs))","volume":"33","author":"Mik\u0161a Mladen","year":"2015"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627928"},{"volume-title":"On the complexity of propositional calculus","author":"Pudl\u00e1k Pavel","key":"e_1_2_1_60_1"},{"key":"e_1_2_1_61_1","doi-asserted-by":"crossref","unstructured":"Pavel Pudl\u00e1k. 2000. Proofs as games. Am. Math. Mon. (2000) 541--550.  Pavel Pudl\u00e1k. 2000. Proofs as games. Am. Math. Mon. (2000) 541--550.","DOI":"10.1080\/00029890.2000.12005233"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000370050013"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.74"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1137\/0403036"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/7531.8928"}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2898435","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2898435","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:30Z","timestamp":1750222590000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2898435"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,18]]},"references-count":61,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,7,22]]}},"alternative-id":["10.1145\/2898435"],"URL":"https:\/\/doi.org\/10.1145\/2898435","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2016,5,18]]},"assertion":[{"value":"2014-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-05-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}