{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:34:29Z","timestamp":1743010469640,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030794156"},{"type":"electronic","value":"9783030794163"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79416-3_22","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T18:03:46Z","timestamp":1623866626000},"page":"361-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Large Clique is Hard on Average for\u00a0Resolution"],"prefix":"10.1007","author":[{"given":"Shuo","family":"Pang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Alekhnovich, M., Johannsen, J., Pitassi, T., Urquhart, A.: An exponential separation between regular and general resolution. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 448\u2013456. ACM (2002)","key":"22_CR1","DOI":"10.1145\/509907.509974"},{"doi-asserted-by":"crossref","unstructured":"Atserias, A., Bonacina, I., de Rezende, S.F., Lauria, M., Nordstr\u00f6m, J., Razborov, A.: Clique is hard on average for regular resolution. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 866\u2013877 (2018)","key":"22_CR2","DOI":"10.1145\/3188745.3188856"},{"issue":"5","key":"22_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3409472","volume":"67","author":"A Atserias","year":"2020","unstructured":"Atserias, A., M\u00fcller, M.: Automating resolution is NP-hard. J. ACM (JACM) 67(5), 1\u201317 (2020)","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00037-007-0230-0","volume":"16","author":"P Beame","year":"2007","unstructured":"Beame, P., Impagliazzo, R., Sabharwal, A.: The resolution complexity of independent sets and vertex covers in random graphs. Comput. Complex. 16(3), 245\u2013297 (2007). https:\/\/doi.org\/10.1007\/s00037-007-0230-0","journal-title":"Comput. Complex."},{"issue":"3","key":"22_CR5","first-page":"20","volume":"14","author":"O Beyersdorff","year":"2013","unstructured":"Beyersdorff, O., Galesi, N., Lauria, M.: Parameterized complexity of DPLL search procedures. ACM Trans. Comput. Log. (TOCL) 14(3), 20 (2013)","journal-title":"ACM Trans. Comput. Log. (TOCL)"},{"doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Erd\u00f6s, P.: Cliques in random graphs. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol. 80, pp. 419\u2013427. Cambridge University Press (1976)","key":"22_CR6","DOI":"10.1017\/S0305004100053056"},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s00453-016-0228-6","volume":"79","author":"I Bonacina","year":"2016","unstructured":"Bonacina, I., Talebanfard, N.: Strong ETH and resolution via games and the multiplicity of strategies. Algorithmica 79(1), 29\u201341 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0228-6","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Garg, A., G\u00f6\u00f6s, M., Kamath, P., Sokolov, D.: Monotone circuit lower bounds from resolution. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 902\u2013911. ACM (2018)","key":"22_CR8","DOI":"10.1145\/3188745.3188838"},{"doi-asserted-by":"crossref","unstructured":"G\u00f6\u00f6s, M., Koroth, S., Mertz, I., Pitassi, T.: Automating cutting planes is NP-hard. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 68\u201377 (2020)","key":"22_CR9","DOI":"10.1145\/3357713.3384248"},{"issue":"5","key":"22_CR10","doi-asserted-by":"publisher","first-page":"1778","DOI":"10.1137\/16M1082007","volume":"47","author":"M G\u00f6\u00f6s","year":"2018","unstructured":"G\u00f6\u00f6s, M., Pitassi, T.: Communication lower bounds via critical block sensitivity. SIAM J. Comput. 47(5), 1778\u20131806 (2018)","journal-title":"SIAM J. Comput."},{"unstructured":"Hajiaghayi, M.T., Khandekar, R., Kortsarz, G.: Fixed parameter inapproximability for clique and setcover in time super-exponential in opt. arXiv preprint arXiv:1310.2711 (2013)","key":"22_CR11"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"A Haken","year":"1985","unstructured":"Haken, A.: The intractability of resolution. Theor. Comput. Sci. 39, 297\u2013308 (1985)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Hastad, J.: Clique is hard to approximate within $$n^{1-\\epsilon }$$. In: Proceedings of 37th Conference on Foundations of Computer Science, pp. 627\u2013636. IEEE (1996)","key":"22_CR13"},{"doi-asserted-by":"crossref","unstructured":"Huynh, T., Nordstrom, J.: On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 233\u2013248 (2012)","key":"22_CR14","DOI":"10.1145\/2213977.2214000"},{"issue":"2","key":"22_CR15","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"},{"key":"22_CR16","first-page":"2","volume":"026","author":"J Ne\u0161et\u0159il","year":"1985","unstructured":"Ne\u0161et\u0159il, J., Poljak, S.: On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae 026, 2 (1985)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"issue":"6","key":"22_CR17","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1080\/00029890.2000.12005233","volume":"107","author":"P Pudl\u00e1k","year":"2000","unstructured":"Pudl\u00e1k, P.: Proofs as games. Am. Math. Mon. 107(6), 541\u2013550 (2000)","journal-title":"Am. Math. Mon."},{"unstructured":"Raz, R., McKenzie, P.: Separation of the monotone NC hierarchy. In: Proceedings 38th Annual Symposium on Foundations of Computer Science, pp. 234\u2013243. IEEE (1997)","key":"22_CR18"},{"unstructured":"Razborov, A.: Lower bounds on the monotone complexity of some Boolean functions. In: Soviet Math. Doklady, vol. 31, pp. 354\u2013357 (1985). English translation","key":"22_CR19"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-46011-X_8","volume-title":"Developments in Language Theory","author":"AA Razborov","year":"2002","unstructured":"Razborov, A.A.: Proof complexity of pigeonhole principles. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 100\u2013116. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46011-X_8"},{"doi-asserted-by":"crossref","unstructured":"Rossman, B.: On the constant-depth complexity of k-clique. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 721\u2013730. ACM (2008)","key":"22_CR21","DOI":"10.1145\/1374376.1374480"},{"issue":"3","key":"22_CR22","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s002360050044","volume":"33","author":"G St\u00e5lmarck","year":"1996","unstructured":"St\u00e5lmarck, G.: Short resolution proofs for a sequence of tricky formulas. Acta Informatica 33(3), 277\u2013280 (1996)","journal-title":"Acta Informatica"},{"issue":"4","key":"22_CR23","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.ipl.2008.10.014","volume":"109","author":"V Vassilevska","year":"2009","unstructured":"Vassilevska, V.: Efficient algorithms for clique problems. Inf. Process. Lett. 109(4), 254\u2013257 (2009)","journal-title":"Inf. Process. Lett."},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-030-51825-7_14","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2020","author":"M Vinyals","year":"2020","unstructured":"Vinyals, M., Elffers, J., Johannsen, J., Nordstr\u00f6m, J.: Simplified and improved separations between regular and general resolution by lifting. In: Pulina, L., Seidl, M. (eds.) SAT 2020. LNCS, vol. 12178, pp. 182\u2013200. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51825-7_14"},{"doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 681\u2013690. ACM (2006)","key":"22_CR25","DOI":"10.1145\/1132516.1132612"}],"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-79416-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T23:22:20Z","timestamp":1623972140000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79416-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030794156","9783030794163"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79416-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","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":"Sochi","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2021\/","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":"68","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":"28","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":"41% - 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.1","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":"9.2","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)"}}]}}