{"id":"https://openalex.org/W2158029166","doi":"https://doi.org/10.2307/2275569","title":"Lower bounds for cutting planes proofs with small coefficients","display_name":"Lower bounds for cutting planes proofs with small coefficients","publication_year":1997,"publication_date":"1997-09-01","ids":{"openalex":"https://openalex.org/W2158029166","doi":"https://doi.org/10.2307/2275569","mag":"2158029166"},"language":"en","primary_location":{"id":"doi:10.2307/2275569","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2275569","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022258975","display_name":"Mar\u0131\u0301a Luisa Bonet","orcid":"https://orcid.org/0000-0003-1646-7177"},"institutions":[{"id":"https://openalex.org/I4210136471","display_name":"FC Barcelona","ror":"https://ror.org/04bpz1v84","country_code":"ES","type":"other","lineage":["https://openalex.org/I4210136471"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Maria Bonet","raw_affiliation_strings":["Department de Lenguajes y Systemas Informaticos, Edificio e Pau Gargallo 5, 08028 Barcelona, Spain, E-mail:","Edificio e Pau Gargallo 5"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department de Lenguajes y Systemas Informaticos, Edificio e Pau Gargallo 5, 08028 Barcelona, Spain, E-mail:","institution_ids":["https://openalex.org/I4210136471"]},{"raw_affiliation_string":"Edificio e Pau Gargallo 5","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003318200","display_name":"Toniann Pitassi","orcid":"https://orcid.org/0000-0002-8668-2174"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Toniann Pitassi","raw_affiliation_strings":["Department of Computer Science, University of Arizona, Tucson, AZ 85721, USA, E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Arizona, Tucson, AZ 85721, USA, E-mail:","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041545934","display_name":"Ran Raz","orcid":"https://orcid.org/0009-0008-1656-2258"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ran Raz","raw_affiliation_strings":["Department of Applied Math, Weizmann Institute, Rehovat 76100, Israel, E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Math, Weizmann Institute, Rehovat 76100, Israel, E-mail:","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.6482,"has_fulltext":false,"cited_by_count":148,"citation_normalized_percentile":{"value":0.97291321,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":"62","issue":"3","first_page":"708","last_page":"728"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9577000141143799,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9577000141143799,"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"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9463000297546387,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.945900022983551,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9318293333053589},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7410489320755005},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.6447988748550415},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5656874775886536},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5580736994743347},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.548655092716217},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5276970863342285},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5250504016876221},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.4743826687335968},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4558109939098358},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16682898998260498},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08576750755310059},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07277709245681763}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.9318293333053589},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7410489320755005},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.6447988748550415},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5656874775886536},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5580736994743347},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.548655092716217},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5276970863342285},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5250504016876221},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.4743826687335968},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4558109939098358},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16682898998260498},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08576750755310059},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07277709245681763},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2307/2275569","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2275569","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1552517802","https://openalex.org/W1890806713","https://openalex.org/W1968584500","https://openalex.org/W1988083342","https://openalex.org/W1993746545","https://openalex.org/W2011276482","https://openalex.org/W2012476164","https://openalex.org/W2025279645","https://openalex.org/W2029109849","https://openalex.org/W2034695532","https://openalex.org/W2038193643","https://openalex.org/W2044632231","https://openalex.org/W2054013713","https://openalex.org/W2069767473","https://openalex.org/W2109174551","https://openalex.org/W2114817374","https://openalex.org/W2117749206","https://openalex.org/W2145243417","https://openalex.org/W2167115661","https://openalex.org/W2174973256","https://openalex.org/W2294221698","https://openalex.org/W4230547894","https://openalex.org/W4250879870","https://openalex.org/W4255046774","https://openalex.org/W4255155072","https://openalex.org/W6639515215","https://openalex.org/W6663619260"],"related_works":["https://openalex.org/W1610564136","https://openalex.org/W2099785256","https://openalex.org/W4288055874","https://openalex.org/W315696179","https://openalex.org/W187835144","https://openalex.org/W2804939161","https://openalex.org/W2186044446","https://openalex.org/W2945126541","https://openalex.org/W1586813864","https://openalex.org/W1500659951"],"abstract_inverted_index":{"Abstract":[0],"We":[1,21,75],"consider":[2],"small-weight":[3,60],"Cutting":[4,10],"Planes":[5,11],"(CP*)":[6],"proofs;":[7],"that":[8,132],"is,":[9],"(CP)":[12],"proofs":[13,85,95,98,105],"with":[14,122,136],"coefficients":[15],"up":[16],"to":[17,31],"Poly(":[18],"n":[19],").":[20],"use":[22],"the":[23,38,50,78,112],"well":[24],"known":[25],"lower":[26,35,71],"bounds":[27],"for":[28,37,43,73,108,120,128],"monotone":[29],"complexity":[30],"prove":[32,77],"an":[33],"exponential":[34,70],"bound":[36,72],"length":[39],"of":[40,46,59,111,143,146],"CP*":[41,84,90,94,113,121],"proofs,":[42],"a":[44,56,66,123],"family":[45],"tautologies":[47],"based":[48],"on":[49],"clique":[51],"function.":[52],"Because":[53],"Resolution":[54],"is":[55],"special":[57],"case":[58],"CP,":[61],"our":[62],"method":[63],"also":[64,76,106,127],"gives":[65],"new":[67],"and":[68,96,126,140],"simpler":[69],"Resolution.":[74],"following":[79],"two":[80],"theorems:":[81],"(1)":[82],"Tree-like":[83,93],"cannot":[86,99],"polynomially":[87,100],"simulate":[88,101],"non-tree-like":[89],"proofs.":[91],"(2)":[92],"Bounded-depth-Frege":[97],"each":[102],"other.":[103],"Our":[104],"work":[107,119],"some":[109],"generalizations":[110],"proof":[114,130],"system.":[115],"In":[116],"particular,":[117],"they":[118],"deduction":[124],"rule,":[125],"any":[129,134,141],"system":[131],"allows":[133],"formula":[135],"small":[137],"communication":[138],"complexity,":[139],"set":[142],"sound":[144],"rules":[145],"inference.":[147]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":30},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":8}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}