{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:30:57Z","timestamp":1742938257668,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030199548"},{"type":"electronic","value":"9783030199555"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19955-5_13","type":"book-chapter","created":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T23:10:01Z","timestamp":1561331401000},"page":"143-155","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Tseitin Formulas, Read-Once Branching Programs and Treewidth"],"prefix":"10.1007","author":[{"given":"Ludmila","family":"Glinskih","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitry","family":"Itsykson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s00037-011-0033-1","volume":"20","author":"M Alekhnovich","year":"2011","unstructured":"Alekhnovich, M., Razborov, A.A.: Satisfiability, branch-width and tseitin tautologies. Comput. Complex. 20(4), 649\u2013678 (2011)","journal-title":"Comput. Complex."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-30201-8_9","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"A Atserias","year":"2004","unstructured":"Atserias, A., Kolaitis, P.G., Vardi, M.Y.: Constraint propagation as a proof system. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 77\u201391. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30201-8_9"},{"key":"13_CR3","unstructured":"Buss, S., Itsykson, D., Knop, A., Sokolov, D.: Reordering rule makes OBDD proof systems stronger. In: CCC-2018, pp. 16:1\u201316:24 (2018)"},{"issue":"5","key":"13_CR4","doi-asserted-by":"publisher","first-page":"40:1","DOI":"10.1145\/2820609","volume":"63","author":"C Chekuri","year":"2016","unstructured":"Chekuri, C., Chuzhoy, J.: Polynomial bounds for the grid-minor theorem. J. ACM 63(5), 40:1\u201340:65 (2016)","journal-title":"J. ACM"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J.: Excluded grid theorem: improved and simplified. In: Proceedings of STOC-2015, pp. 645\u2013654 (2015)","DOI":"10.1145\/2746539.2746551"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Dantchev, S.S., Riis, S.: \u201cplanar\u201d tautologies hard for resolution. In: FOCS-2001, pp. 220\u2013229 (2001)","DOI":"10.1109\/SFCS.2001.959896"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/11591191_34","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A Ferrara","year":"2005","unstructured":"Ferrara, A., Pan, G., Vardi, M.Y.: Treewidth in verification: local vs. global. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 489\u2013503. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11591191_34"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-94144-8_19","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"N Galesi","year":"2018","unstructured":"Galesi, N., Talebanfard, N., Tor\u00e1n, J.: Cops-robber games and the resolution of Tseitin formulas. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 311\u2013326. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_19"},{"key":"13_CR9","unstructured":"Glinskih, L., Itsykson, D.: Satisfiable Tseitin formulas are hard for nondeterministic read-once branching programs. In: MFCS-2017, pp. 26:1\u201326:12 (2017)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Glinskih, L., Itsykson, D.: On Tseitin formulas, read-once branching programs and treewidth. Technical Reports. TR-19-020, ECCC (2019)","DOI":"10.1007\/978-3-030-19955-5_13"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/s00453-012-9627-5","volume":"64","author":"QP Gu","year":"2012","unstructured":"Gu, Q.P., Tamaki, H.: Improved bounds on the planar branchwidth with respect to the largest grid minor size. Algorithmica 64(3), 416\u2013453 (2012)","journal-title":"Algorithmica"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J.: On small-depth Frege proofs for Tseitin for grids. In: FOCS-2017, pp. 97\u2013108 (2017)","DOI":"10.1109\/FOCS.2017.18"},{"key":"13_CR13","unstructured":"Itsykson, D., Knop, A., Romashchenko, A., Sokolov, D.: On OBDD-based algorithms and proof systems that dynamically change order of variables. In: STACS-2017, pp. 43:1\u201343:14 (2017)"},{"issue":"1","key":"13_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(93)90171-J","volume":"43","author":"E Korach","year":"1993","unstructured":"Korach, E., Solel, N.: Tree-width, path-width, and cutwidth. Discrete Appl. Math. 43(1), 97\u2013101 (1993)","journal-title":"Discrete Appl. Math."},{"key":"13_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511529948","volume-title":"Bounded Arithmetic, Propositional Logic and Complexity Theory","author":"J Kraj\u00ed\u010dek","year":"1995","unstructured":"Kraj\u00ed\u010dek, J.: Bounded Arithmetic, Propositional Logic and Complexity Theory. Cambridge University Press, Cambridge (1995)"},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/S0895480192233867","volume":"8","author":"L Lov\u00e1sz","year":"1995","unstructured":"Lov\u00e1sz, L., Naor, M., Newman, I., Wigderson, A.: Search problems in the decision tree model. SIAM J. Discrete Math. 8(1), 119\u2013132 (1995)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00453-015-0059-x","volume":"75","author":"I Razgon","year":"2016","unstructured":"Razgon, I.: On the read-once property of branching programs and CNFs of bounded treewidth. Algorithmica 75(2), 277\u2013294 (2016)","journal-title":"Algorithmica"},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1006\/jctb.1994.1073","volume":"62","author":"N Robertson","year":"1994","unstructured":"Robertson, N., Seymour, P., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theory Ser. B 62(2), 323\u2013348 (1994)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Comb. Theory Ser. B 41(1), 92\u2013114 (1986)","journal-title":"J. Comb. Theory Ser. B"},{"key":"13_CR20","first-page":"234","volume":"8","author":"GS Tseitin","year":"1968","unstructured":"Tseitin, G.S.: On the complexity of derivation in the propositional calculus. Zapiski nauchnykh seminarov LOMI 8, 234\u2013259 (1968)","journal-title":"Zapiski nauchnykh seminarov LOMI"},{"issue":"1","key":"13_CR21","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/7531.8928","volume":"34","author":"A Urquhart","year":"1987","unstructured":"Urquhart, A.: Hard examples for resolution. JACM 34(1), 209\u2013219 (1987)","journal-title":"JACM"},{"key":"13_CR22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719789","volume-title":"Branching Programs and Binary Decision Diagrams","author":"I Wegener","year":"2000","unstructured":"Wegener, I.: Branching Programs and Binary Decision Diagrams. SIAM, Philadelphia (2000)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19955-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:02:07Z","timestamp":1710349327000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19955-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030199548","9783030199555"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19955-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}