{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:03:06Z","timestamp":1742922186958,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030617912"},{"type":"electronic","value":"9783030617929"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-61792-9_27","type":"book-chapter","created":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:15:48Z","timestamp":1606943748000},"page":"336-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sherali-Adams and the Binary Encoding of Combinatorial Principles"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Dantchev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdul","family":"Ghani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barnaby","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,3]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","unstructured":"Atserias, A., Lauria, M., Nordstr\u00f6m, J.: Narrow proofs may be maximally long. ACM Trans. Comput. Log. 17(3), 19:1\u201319:30 (2016). https:\/\/doi.org\/10.1145\/2898435","DOI":"10.1145\/2898435"},{"key":"27_CR2","unstructured":"Barak, B., Steurer, D.: Sum-of-squares proofs and the quest toward optimal algorithms. In: Proceedings of the International Congress of Mathematicians (ICM), vol. IV, pp. 509\u2013533 (2014)"},{"key":"27_CR3","doi-asserted-by":"publisher","unstructured":"Bonacina, I., Galesi, N.: A framework for space complexity in algebraic proof systems. J. ACM 62(3), 23:1\u201323:20 (2015). https:\/\/doi.org\/10.1145\/2699438","DOI":"10.1145\/2699438"},{"issue":"5","key":"27_CR4","doi-asserted-by":"publisher","first-page":"1894","DOI":"10.1137\/15M1023269","volume":"45","author":"I Bonacina","year":"2016","unstructured":"Bonacina, I., Galesi, N., Thapen, N.: Total space in resolution. SIAM J. Comput. 45(5), 1894\u20131909 (2016). https:\/\/doi.org\/10.1137\/15M1023269","journal-title":"SIAM J. Comput."},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BFb0028012","volume-title":"Computer Science Logic","author":"S Buss","year":"1998","unstructured":"Buss, S., Pitassi, T.: Resolution and the weak pigeonhole principle. In: Nielsen, M., Thomas, W. (eds.) CSL 1997. LNCS, vol. 1414, pp. 149\u2013156. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028012"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4, 305\u2013337 (1973)","journal-title":"Discrete Math."},{"key":"27_CR7","doi-asserted-by":"publisher","unstructured":"Dantchev, S.S.: Rank complexity gap for Lov\u00e1sz-Schrijver and Sherali-Adams proof systems. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp. 311\u2013317. ACM Press (2007). https:\/\/doi.org\/10.1145\/1250790.1250837","DOI":"10.1145\/1250790.1250837"},{"key":"27_CR8","doi-asserted-by":"publisher","unstructured":"Dantchev, S.S., Galesi, N., Martin, B.: Resolution and the binary encoding of combinatorial principles. In: Proceedings of the 34th Computational Complexity Conference, CCC 2019, New Brunswick, NJ, USA, 18\u201320 July 2019, pp. 6:1\u20136:25 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CCC.2019.6","DOI":"10.4230\/LIPIcs.CCC.2019.6"},{"key":"27_CR9","doi-asserted-by":"publisher","unstructured":"Dantchev, S.S., Martin, B., Rhodes, M.N.C.: Tight rank lower bounds for the Sherali-Adams proof system. Theor. Comput. Sci. 410(21-23), 2054\u20132063 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.01.002","DOI":"10.1016\/j.tcs.2009.01.002"},{"issue":"4","key":"27_CR10","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1137\/120895950","volume":"44","author":"Y Filmus","year":"2015","unstructured":"Filmus, Y., Lauria, M., Nordstr\u00f6m, J., Ron-Zewi, N., Thapen, N.: Space complexity in polynomial calculus. SIAM J. Comput. 44(4), 1119\u20131153 (2015). https:\/\/doi.org\/10.1137\/120895950","journal-title":"SIAM J. Comput."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Gomory, R.E.: Solving linear programming problems in integers. In: Bellman, R., Hall, M. (eds.) Combinatorial Analysis, Proceedings of Symposia in Applied Mathematics. Providence, RI, vol. 10 (1960)","DOI":"10.1090\/psapm\/010\/0114670"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/3-540-45841-7_34","volume-title":"STACS 2002","author":"D Grigoriev","year":"2002","unstructured":"Grigoriev, D., Hirsch, E.A., Pasechnik, D.V.: Complexity of semi-algebraic proofs. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 419\u2013430. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45841-7_34"},{"key":"27_CR13","doi-asserted-by":"publisher","unstructured":"Hrubes, P., Pudl\u00e1k, P.: Random formulas, monotone circuits, and interpolation. In: Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, 15\u201317 October 2017, pp. 121\u2013131. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/FOCS.2017.20","DOI":"10.1109\/FOCS.2017.20"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-45535-3_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: An explicit exact SDP relaxation for nonlinear 0-1 programs. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 293\u2013303. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45535-3_23"},{"key":"27_CR15","unstructured":"Laurent, M.: A comparison of the Sherali-Adams, Lov\u00e1sz-Schrijver and Lasserre relaxations for $$0-1$$ programming. Technical report PNA-R0108, Amsterdam (2001)"},{"issue":"4","key":"27_CR16","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s00037-017-0152-4","volume":"26","author":"M Lauria","year":"2017","unstructured":"Lauria, M., Nordstr\u00f6m, J.: Tight size-degree bounds for sums-of-squares proofs. Comput. Complex. 26(4), 911\u2013948 (2017). https:\/\/doi.org\/10.1007\/s00037-017-0152-4","journal-title":"Comput. Complex."},{"issue":"2","key":"27_CR17","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00493-015-3193-9","volume":"37","author":"M Lauria","year":"2017","unstructured":"Lauria, M., Pudl\u00e1k, P., R\u00f6dl, V., Thapen, N.: The complexity of proving that a graph is Ramsey. Combinatorica 37(2), 253\u2013268 (2017). https:\/\/doi.org\/10.1007\/s00493-015-3193-9","journal-title":"Combinatorica"},{"issue":"2","key":"27_CR18","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and $$0$$-$$1$$ optimization. SIAM J. Optim. 1(2), 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"27_CR19","unstructured":"Potechin, A.: Sum of squares bounds for the total ordering principle. arXiv e-prints, p. 1812.01163 (2018)"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/978-3-540-73001-9_67","volume-title":"Computation and Logic in the Real World","author":"M Rhodes","year":"2007","unstructured":"Rhodes, M.: Rank lower bounds for the Sherali-Adams operator. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol. 4497, pp. 648\u2013659. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73001-9_67"},{"issue":"3","key":"27_CR21","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s00037-001-8194-y","volume":"10","author":"S Riis","year":"2001","unstructured":"Riis, S.: A complexity gap for tree resolution. Comput. Complex. 10(3), 179\u2013209 (2001). https:\/\/doi.org\/10.1007\/s00037-001-8194-y","journal-title":"Comput. Complex."},{"issue":"3","key":"27_CR22","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3), 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","LATIN 2020: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61792-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:37:51Z","timestamp":1606945071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61792-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030617912","9783030617929"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61792-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sao Paulo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2021","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":"latin2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2020.ime.usp.br\/","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":"136","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":"50","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":"37% - 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,16","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic the symposium was moved from May 2020 to January 2021.","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)"}}]}}