{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:44:45Z","timestamp":1742913885792,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031304477"},{"type":"electronic","value":"9783031304484"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30448-4_3","type":"book-chapter","created":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T20:29:36Z","timestamp":1682368176000},"page":"21-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Power of\u00a0the\u00a0Binary Value Principle"],"prefix":"10.1007","author":[{"given":"Yaroslav","family":"Alekseev","sequence":"first","affiliation":[]},{"given":"Edward A.","family":"Hirsch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,25]]},"reference":[{"key":"3_CR1","unstructured":"Alekseev, Y.: A lower bound for polynomial calculus with extension rule. In: CCC-2021. Leibniz International Proceedings in Informatics (LIPIcs), vol. 200, pp. 21:1\u201321:18. Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Alekseev, Y., Grigoriev, D., Hirsch, E.A., Tzameret, I.: Semi-algebraic proofs, IPS lower bounds and the $$\\tau $$-conjecture: Can a natural number be negative? In: STOC-2020. pp. 54\u201367 (2020). Technical details can be found in ECCC TR19-142","DOI":"10.1145\/3357713.3384245"},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"916","DOI":"10.2307\/2273826","volume":"52","author":"SR Buss","year":"1987","unstructured":"Buss, S.R.: Polynomial size proofs of the propositional pigeonhole principle. J. Symb. Log. 52(4), 916\u2013927 (1987)","journal-title":"J. Symb. Log."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Clegg, M., Edmonds, J., Impagliazzo, R.: Using the Groebner basis algorithm to find proofs of unsatisfiability. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996), pp. 174\u2013183. ACM (1996)","DOI":"10.1145\/237814.237860"},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"36","DOI":"10.2307\/2273702","volume":"44","author":"SA Cook","year":"1979","unstructured":"Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. J. Symb. Log. 44(1), 36\u201350 (1979)","journal-title":"J. Symb. Log."},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0304-3975(02)00446-2","volume":"303","author":"D Grigoriev","year":"2003","unstructured":"Grigoriev, D., Hirsch, E.A.: Algebraic proof systems over formulas. Theoret. Comput. Sci. 303(1), 83\u2013102 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Grigoriev, D., Hirsch, E.A., Pasechnik, D.V.: Complexity of semialgebraic proofs. Mosc. Math. J. 2(4), 647\u2013679, 805 (2002)","DOI":"10.17323\/1609-4514-2002-2-4-647-679"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Grochow, J.A., Pitassi, T.: Circuit complexity, proof complexity, and polynomial identity testing: the ideal proof system. J. ACM 65(6), 37:1\u201337:59 (2018)","DOI":"10.1145\/3230742"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Part, F., Thapen, N., Tzameret, I.: First-order reasoning and efficient semi-algebraic proofs. In: 36th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, 29 June\u20132 July 2021, pp. 1\u201313. IEEE (2021)","DOI":"10.1109\/LICS52264.2021.9470546"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-020-00202-x","volume":"30","author":"Fedor Part","year":"2021","unstructured":"Part, Fedor, Tzameret, Iddo: Resolution with counting: Dag-like lower bounds and different moduli. Comput. Complex. 30(1), 1\u201371 (2021). https:\/\/doi.org\/10.1007\/s00037-020-00202-x","journal-title":"Comput. Complex."},{"key":"3_CR11","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1017\/CBO9781107325944.010","volume-title":"Sets and Proofs (Leeds 1997)","author":"P Pudl\u00e1k","year":"1999","unstructured":"Pudl\u00e1k, P.: On the complexity of the propositional calculus. In: Sets and Proofs (Leeds 1997). London Mathematical Society Lecture Note Series, vol. 258, pp. 197\u2013218. Cambridge University Press, Cambridge (1999)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Tseitin, G.S.: On the complexity of derivation in the propositional calculus. Zapiski nauchnykh seminarov LOMI 8, 234\u2013259 (1968). English translation of this volume: Consultants Bureau, N.Y., 1970, pp. 115\u2013125","DOI":"10.1007\/978-1-4899-5327-8_25"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30448-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T23:03:26Z","timestamp":1684191806000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30448-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031304477","9783031304484"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30448-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Larnaca","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","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":"25","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":"51% - 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":"6","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)"}},{"value":"3 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}