{"id":"https://openalex.org/W3016887704","doi":"https://doi.org/10.1145/3357713.3384248","title":"Automating cutting planes is NP-hard","display_name":"Automating cutting planes is NP-hard","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3016887704","doi":"https://doi.org/10.1145/3357713.3384248","mag":"3016887704"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384248","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384248","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2004.08037","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065903790","display_name":"Mika G\u00f6\u00f6s","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mika G\u00f6\u00f6s","raw_affiliation_strings":["Stanford University, USA","Stanford Univ USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Stanford Univ USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030492623","display_name":"Sajin Koroth","orcid":"https://orcid.org/0000-0002-7989-1963"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Sajin Koroth","raw_affiliation_strings":["Simon Fraser University, Canada","Simon Fraser University (Canada)#TAB#"],"affiliations":[{"raw_affiliation_string":"Simon Fraser University, Canada","institution_ids":["https://openalex.org/I18014758"]},{"raw_affiliation_string":"Simon Fraser University (Canada)#TAB#","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015894874","display_name":"Ian Mertz","orcid":"https://orcid.org/0000-0002-4715-933X"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ian Mertz","raw_affiliation_strings":["University of Toronto, Canada","(University of Toronto, Canada"],"affiliations":[{"raw_affiliation_string":"University of Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"(University of Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003318200","display_name":"Toniann Pitassi","orcid":"https://orcid.org/0000-0002-8668-2174"},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]},{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA","US"],"is_corresponding":false,"raw_author_name":"Toniann Pitassi","raw_affiliation_strings":["University of Toronto, Canada / Institute for Advanced Study at Princeton, USA"],"affiliations":[{"raw_affiliation_string":"University of Toronto, Canada / Institute for Advanced Study at Princeton, USA","institution_ids":["https://openalex.org/I40036882","https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5065903790"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":1.50968188,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.83344241,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"27","issue":null,"first_page":"68","last_page":"77"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.8315826654434204},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6098650097846985},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6050066947937012},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5994194149971008},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5871970653533936},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.562752902507782},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5266656279563904},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4977993965148926},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4718760550022125},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3208506107330322},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10383793711662292},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.04746052622795105}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8315826654434204},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6098650097846985},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6050066947937012},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5994194149971008},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5871970653533936},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.562752902507782},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5266656279563904},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4977993965148926},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4718760550022125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3208506107330322},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10383793711662292},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.04746052622795105},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/3357713.3384248","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384248","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2004.08037","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2004.08037","pdf_url":"https://arxiv.org/pdf/2004.08037","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"mag:3016887704","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2004.08037.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:infoscience.epfl.ch:299563","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/299563","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"},{"id":"doi:10.48550/arxiv.2004.08037","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2004.08037","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"mag:3034850088","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc27.html#GoosKMP20","pdf_url":null,"source":{"id":"https://openalex.org/S4306509107","display_name":"Electron. Colloquium Comput. Complex.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electron. Colloquium Comput. Complex.","raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2004.08037","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2004.08037","pdf_url":"https://arxiv.org/pdf/2004.08037","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W141966453","https://openalex.org/W1567308215","https://openalex.org/W1814032955","https://openalex.org/W1924552658","https://openalex.org/W1970193303","https://openalex.org/W1985572324","https://openalex.org/W1999069928","https://openalex.org/W2006906201","https://openalex.org/W2021972008","https://openalex.org/W2034266713","https://openalex.org/W2037611290","https://openalex.org/W2038193643","https://openalex.org/W2039681975","https://openalex.org/W2044095368","https://openalex.org/W2044632231","https://openalex.org/W2047237020","https://openalex.org/W2054013713","https://openalex.org/W2068363706","https://openalex.org/W2083193613","https://openalex.org/W2084384424","https://openalex.org/W2093224650","https://openalex.org/W2098022011","https://openalex.org/W2129413084","https://openalex.org/W2132489129","https://openalex.org/W2142326240","https://openalex.org/W2144047381","https://openalex.org/W2152390092","https://openalex.org/W2153159703","https://openalex.org/W2158029166","https://openalex.org/W2220094226","https://openalex.org/W2563018125","https://openalex.org/W2583114560","https://openalex.org/W2594565427","https://openalex.org/W2768379587","https://openalex.org/W2768698559","https://openalex.org/W2768857456","https://openalex.org/W2773609948","https://openalex.org/W2809677183","https://openalex.org/W2897781990","https://openalex.org/W2914732100","https://openalex.org/W2955659726","https://openalex.org/W2964642894","https://openalex.org/W2969433745","https://openalex.org/W2972093011","https://openalex.org/W2996640527","https://openalex.org/W3004119281","https://openalex.org/W3014805183","https://openalex.org/W3016887704","https://openalex.org/W3022335368","https://openalex.org/W3029612892","https://openalex.org/W3129102708","https://openalex.org/W3130516212","https://openalex.org/W3137706500","https://openalex.org/W4205196152","https://openalex.org/W4239237828","https://openalex.org/W4241426617"],"related_works":["https://openalex.org/W3034850088","https://openalex.org/W2996566436","https://openalex.org/W2164683439","https://openalex.org/W2463107392","https://openalex.org/W2148352980","https://openalex.org/W2999348373","https://openalex.org/W1998964055","https://openalex.org/W2058258808","https://openalex.org/W3127217102","https://openalex.org/W1699753700","https://openalex.org/W3196550748","https://openalex.org/W2001663593","https://openalex.org/W2133839241","https://openalex.org/W2951531405","https://openalex.org/W2417894922","https://openalex.org/W2949548458","https://openalex.org/W2624065397","https://openalex.org/W2730643286","https://openalex.org/W73004332","https://openalex.org/W2404960361"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,78,105],"Cutting":[3],"Planes":[4],"(CP)":[5],"proofs":[6,86],"are":[7],"hard":[8],"to":[9,20],"find:":[10],"Given":[11],"an":[12,80,107],"unsatisfiable":[13],"formula":[14],"$F$,":[15],"1)":[16],"It":[17],"is":[18],"NP-hard":[19],"find":[21,47],"a":[22,42,48],"CP":[23,50],"refutation":[24,51],"of":[25,33,52,60,72,112,118],"$F$":[26,53],"in":[27,30,54,57],"time":[28,55],"polynomial":[29,56],"the":[31,34,58,61,69],"length":[32,59],"shortest":[35,62],"such":[36,63],"refutation;":[37],"and":[38,74],"2)unless":[39],"Gap-Hitting-Set":[40],"admits":[41],"nontrivial":[43],"algorithm,":[44],"one":[45],"cannot":[46],"tree-like":[49],"refutation.":[64],"The":[65],"first":[66],"result":[67,82],"extends":[68],"recent":[70],"breakthrough":[71],"Atserias":[73],"M\u00fcller":[75],"(FOCS":[76],"2019)":[77],"established":[79],"analogous":[81],"for":[83,96],"Resolution.":[84],"Our":[85],"rely":[87],"on":[88],"two":[89],"new":[90],"lifting":[91,95,104],"theorems:":[92],"(1)":[93],"Dag-like":[94],"gadgets":[97,111],"with":[98,110],"many":[99],"output":[100],"bits.":[101],"(2)":[102],"Tree-like":[103],"simulates":[106],"$r$-round":[108],"protocol":[109],"query":[113],"complexity":[114],"$O(\\log":[115],"r)$":[116],"independent":[117],"input":[119],"length.":[120]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}