{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:59:38Z","timestamp":1729645178373,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1109\/lics.2007.42","type":"proceedings-article","created":{"date-parts":[[2008,7,18]],"date-time":"2008-07-18T16:49:29Z","timestamp":1216399769000},"page":"235-244","source":"Crossref","is-referenced-by-count":3,"title":["Separating DAG-Like and Tree-Like Proof Systems"],"prefix":"10.1109","author":[{"given":"Phuong","family":"Nguyen","sequence":"first","affiliation":[]}],"member":"263","reference":[{"article-title":"Computational limitations for small depth circuits","year":"1987","author":"hastad","key":"ref10"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2307\/2275250","article-title":"Lower bounds to the size of constant-depth propositional proofs","volume":"59","author":"kraj??","year":"1994","journal-title":"J Symbolic Logic"},{"article-title":"Bounded Arithmetic, Propositional Logic, and Complexity Theory","year":"1995","author":"kraj??","key":"ref12"},{"key":"ref13","article-title":"Quantified Propositional Calculi and Fragments of Bounded Arithmetic","volume":"36","author":"kraj??","year":"1990","journal-title":"Zeitschrift f Mathematkal Logik u Grundlagen d Mathematik"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.19"},{"key":"ref15","article-title":"Logical Approaches to the Complexity of Search Problems","author":"morioka","year":"2005","journal-title":"Proof Complexity Quantified Propositional Calculus and Bounded Arithmetic"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.42"},{"article-title":"Examining the Fragments of G This proceeding","year":"0","author":"perron","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0003-4843(78)90011-6"},{"key":"ref4","article-title":"Weak Formal Systems and Connections to Computational Complexity","author":"buss","year":"1988","journal-title":"Lecture Notes for a Topic Course"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2005.05.002"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04943-3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01845704"},{"key":"ref8","article-title":"Foundations of Proof Complexity","author":"cook","year":"2006","journal-title":"Bounded Arithmetic and Propositional Translations"},{"key":"ref7","first-page":"711","article-title":"Quantified Propositional Calculus and a Second-Order Theory for NC1 Archive for Mathematical Logic","volume":"44","author":"cook","year":"2005"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-73.1.1"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00193-X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12132"}],"event":{"name":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","start":{"date-parts":[[2007,7,10]]},"location":"Wroclaw, Poland","end":{"date-parts":[[2007,7,14]]}},"container-title":["22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4276538\/4276539\/04276568.pdf?arnumber=4276568","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T10:04:49Z","timestamp":1497780289000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4276568\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/lics.2007.42","relation":{},"subject":[],"published":{"date-parts":[[2007]]}}}