{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T04:53:58Z","timestamp":1777006438328,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,14]],"date-time":"2016-01-14T00:00:00Z","timestamp":1452729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000925","name":"John Templeton Foundation","doi-asserted-by":"publisher","award":["48138"],"award-info":[{"award-number":["48138"]}],"id":[{"id":"10.13039\/100000925","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/L024233\/1"],"award-info":[{"award-number":["EP\/L024233\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,14]]},"DOI":"10.1145\/2840728.2840740","type":"proceedings-article","created":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T14:26:11Z","timestamp":1452003971000},"page":"249-260","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Lower Bounds"],"prefix":"10.1145","author":[{"given":"Olaf","family":"Beyersdorff","sequence":"first","affiliation":[{"name":"University of Leeds, Leeds, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilario","family":"Bonacina","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chew","family":"Leroy","sequence":"additional","affiliation":[{"name":"University of Leeds, Leeds, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,1,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01302964"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity - A Modern Approach","author":"Arora Sanjeev","year":"2009","unstructured":"Sanjeev Arora and Boaz Barak . Computational Complexity - A Modern Approach . Cambridge University Press , 2009 . Sanjeev Arora and Boaz Barak. Computational Complexity - A Modern Approach. Cambridge University Press, 2009."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-012-0152-6"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09284-3_12"},{"key":"e_1_3_2_1_5_1","first-page":"42","volume-title":"Current Trends in Theoretical Computer Science: Entering the 21st Century","author":"Beame Paul","year":"2001","unstructured":"Paul Beame and Toniann Pitassi . Propositional proof complexity: Past, present, and future . In G. Paun, G. Rozenberg, and A. Salomaa, editors, Current Trends in Theoretical Computer Science: Entering the 21st Century , pages 42 -- 70 . World Scientific Publishing , 2001 . Paul Beame and Toniann Pitassi. Propositional proof complexity: Past, present, and future. In G. Paun, G. Rozenberg, and A. Salomaa, editors, Current Trends in Theoretical Computer Science: Entering the 21st Century, pages 42--70. World Scientific Publishing, 2001."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375835"},{"issue":"1","key":"e_1_3_2_1_7_1","first-page":"133","article-title":"QBF-based formal verification: Experience and perspectives","volume":"5","author":"Benedetti Marco","year":"2008","unstructured":"Marco Benedetti and Hratch Mangassarian . QBF-based formal verification: Experience and perspectives . JSAT , 5 ( 1-4 ): 133 -- 191 , 2008 . Marco Benedetti and Hratch Mangassarian. QBF-based formal verification: Experience and perspectives. JSAT, 5 (1-4): 133--191, 2008.","journal-title":"JSAT"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09284-3_13"},{"key":"e_1_3_2_1_9_1","first-page":"81","volume-title":"II","author":"Beyersdorff Olaf","year":"2014","unstructured":"Olaf Beyersdorff , Leroy Chew , and Mikol\u00e1s Janota . On unification of QBF resolution-based calculi. In MFCS , II , pages 81 -- 93 , 2014 . Olaf Beyersdorff, Leroy Chew, and Mikol\u00e1s Janota. On unification of QBF resolution-based calculi. In MFCS, II, pages 81--93, 2014."},{"key":"e_1_3_2_1_10_1","first-page":"76","volume-title":"32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015","author":"Beyersdorff Olaf","year":"2015","unstructured":"Olaf Beyersdorff , Leroy Chew , and Mikol\u00e1s Janota . Proof complexity of resolution-based QBF calculi . In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015 ), pages 76 -- 89 , 2015 . Olaf Beyersdorff, Leroy Chew, and Mikol\u00e1s Janota. Proof complexity of resolution-based QBF calculi. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015), pages 76--89, 2015."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47672-7_15"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798353230"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-004-0183-5"},{"key":"e_1_3_2_1_15_1","first-page":"757","volume-title":"Boppana and Michael Sipser. Handbook of theoretical computer science (vol. A)","author":"Ravi","year":"1990","unstructured":"Ravi B. Boppana and Michael Sipser. Handbook of theoretical computer science (vol. A) . chapter The Complexity of Finite Functions, pages 757 -- 804 . MIT Press , Cambridge, MA, USA , 1990 . Ravi B. Boppana and Michael Sipser. Handbook of theoretical computer science (vol. A). chapter The Complexity of Finite Functions, pages 757--804. MIT Press, Cambridge, MA, USA, 1990."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2011.09.009"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01845704"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237860"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00153-005-0282-2"},{"key":"e_1_3_2_1_20_1","first-page":"169","article-title":"The relative efficiency of propositional proof systems","volume":"6","author":"Cook Stephen A.","year":"1979","unstructured":"Stephen A. Cook and Robert A. Reckhow . The relative efficiency of propositional proof systems . Journal of Symbolic Logic , 6 : 169 -- 184 , 1979 . Stephen A. Cook and Robert A. Reckhow. The relative efficiency of propositional proof systems. Journal of Symbolic Logic, 6: 169--184, 1979.","journal-title":"Journal of Symbolic Logic"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(87)90039-4"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31612-8_9"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13770-4_11"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2283396.2283486"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90144-6"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12132"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08587-6_7"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2008.09.013"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.01.048"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2008.10.005"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1025"},{"key":"e_1_3_2_1_33_1","volume-title":"Propositional Logic and Complexity Theory","author":"Kraj\u00ed\u010dek Jan","year":"1995","unstructured":"Jan Kraj\u00ed\u010dek . Bounded Arithmetic , Propositional Logic and Complexity Theory . Cambridge University Press , 1995 . Jan Kraj\u00ed\u010dek. Bounded Arithmetic, Propositional Logic and Complexity Theory. Cambridge University Press, 1995."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275541"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.2307\/2274765"},{"key":"e_1_3_2_1_36_1","volume-title":"Quantified propositional calculi and fragments of bounded arithmetic. Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik, 36: 29--46","author":"Kraj\u00ed\u010dek Jan","year":"1990","unstructured":"Jan Kraj\u00ed\u010dek and Pavel Pudl\u00e1k . Quantified propositional calculi and fragments of bounded arithmetic. Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik, 36: 29--46 , 1990 . Jan Kraj\u00ed\u010dek and Pavel Pudl\u00e1k. Quantified propositional calculi and fragments of bounded arithmetic. Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik, 36: 29--46, 1990."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2674"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240070103"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321882"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200117"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275583"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01137685"},{"key":"e_1_3_2_1_43_1","first-page":"1045","volume-title":"AAAI","author":"Rintanen Jussi","year":"2007","unstructured":"Jussi Rintanen . Asymptotically optimal encodings of conformant planning in QBF . In AAAI , pages 1045 -- 1050 . AAAI Press , 2007 . Jussi Rintanen. Asymptotically optimal encodings of conformant planning in QBF. In AAAI, pages 1045--1050. AAAI Press, 2007."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022607331053"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/321250.321253"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1203350879"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28404"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/2969951.2970003"}],"event":{"name":"ITCS'16: Innovations in Theoretical Computer Science","location":"Cambridge Massachusetts USA","acronym":"ITCS'16","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2840728.2840740","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2840728.2840740","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:53:47Z","timestamp":1750222427000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2840728.2840740"}},"subtitle":["From Circuits to QBF Proof Systems"],"short-title":[],"issued":{"date-parts":[[2016,1,14]]},"references-count":46,"alternative-id":["10.1145\/2840728.2840740","10.1145\/2840728"],"URL":"https:\/\/doi.org\/10.1145\/2840728.2840740","relation":{},"subject":[],"published":{"date-parts":[[2016,1,14]]},"assertion":[{"value":"2016-01-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}