{"id":"https://openalex.org/W2006906201","doi":"https://doi.org/10.2307/2694916","title":"Minimum propositional proof length is NP-hard to linearly approximate","display_name":"Minimum propositional proof length is NP-hard to linearly approximate","publication_year":2001,"publication_date":"2001-03-01","ids":{"openalex":"https://openalex.org/W2006906201","doi":"https://doi.org/10.2307/2694916","mag":"2006906201"},"language":"en","primary_location":{"id":"doi:10.2307/2694916","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2694916","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/A5108192310","display_name":"Michael Alekhnovich","orcid":null},"institutions":[{"id":"https://openalex.org/I19880235","display_name":"Lomonosov Moscow State University","ror":"https://ror.org/010pmpe69","country_code":"RU","type":"education","lineage":["https://openalex.org/I19880235"]},{"id":"https://openalex.org/I4210150146","display_name":"Moscow State University","ror":"https://ror.org/050a13t43","country_code":"TJ","type":"education","lineage":["https://openalex.org/I4210150146"]}],"countries":["RU","TJ"],"is_corresponding":true,"raw_author_name":"Michael Alekhnovich","raw_affiliation_strings":["Faculty of Mechanics & Mathematics, Moscow State University, Russia, E-mail:","Moscow State  University"],"affiliations":[{"raw_affiliation_string":"Faculty of Mechanics & Mathematics, Moscow State University, Russia, E-mail:","institution_ids":["https://openalex.org/I19880235"]},{"raw_affiliation_string":"Moscow State  University","institution_ids":["https://openalex.org/I4210150146"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067079243","display_name":"Sam Buss","orcid":"https://orcid.org/0000-0003-3837-334X"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]},{"id":"https://openalex.org/I2803209242","display_name":"University of California System","ror":"https://ror.org/00pjdza24","country_code":"US","type":"education","lineage":["https://openalex.org/I2803209242"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sam Buss","raw_affiliation_strings":["Department of Mathematics, University of California, San Diego, LA Jolla. CA 92093., USA, E-mail:","University of California"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of California, San Diego, LA Jolla. CA 92093., USA, E-mail:","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"University of California","institution_ids":["https://openalex.org/I2803209242"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007961513","display_name":"Shlomo Moran","orcid":"https://orcid.org/0000-0003-3222-3308"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shlomo Moran","raw_affiliation_strings":["Department of Computer Science, Technion, Israel Institute of Technology, Haifa. Israel 32000, E-mail:","Israel Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technion, Israel Institute of Technology, Haifa. Israel 32000, E-mail:","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Israel Institute of Technology","institution_ids":["https://openalex.org/I174306211"]}]},{"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/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":["Computer Science Department, University of Arizona, Tucson, AZ 85721., USA, E-mail:","University of Arizona"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Arizona, Tucson, AZ 85721., USA, E-mail:","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"University of Arizona","institution_ids":["https://openalex.org/I138006243"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5108192310"],"corresponding_institution_ids":["https://openalex.org/I19880235","https://openalex.org/I4210150146"],"apc_list":null,"apc_paid":null,"fwci":3.196,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.91302114,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"66","issue":"1","first_page":"171","last_page":"191"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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/T10142","display_name":"Formal Methods in Verification","score":0.998199999332428,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9958000183105469,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.795184314250946},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6943157911300659},{"id":"https://openalex.org/keywords/sequent-calculus","display_name":"Sequent calculus","score":0.6906346678733826},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6760967373847961},{"id":"https://openalex.org/keywords/sequent","display_name":"Sequent","score":0.650597333908081},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.5691692233085632},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.49046871066093445},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.48045963048934937},{"id":"https://openalex.org/keywords/natural-deduction","display_name":"Natural deduction","score":0.4765886962413788},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.4726273715496063},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4577147364616394},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35328829288482666},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16243919730186462},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.060025036334991455}],"concepts":[{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.795184314250946},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6943157911300659},{"id":"https://openalex.org/C65880906","wikidata":"https://www.wikidata.org/wiki/Q1771121","display_name":"Sequent calculus","level":3,"score":0.6906346678733826},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6760967373847961},{"id":"https://openalex.org/C89421646","wikidata":"https://www.wikidata.org/wiki/Q843632","display_name":"Sequent","level":2,"score":0.650597333908081},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.5691692233085632},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.49046871066093445},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.48045963048934937},{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.4765886962413788},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.4726273715496063},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4577147364616394},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35328829288482666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16243919730186462},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.060025036334991455},{"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/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2307/2694916","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2694916","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W204341840","https://openalex.org/W225145913","https://openalex.org/W1525683323","https://openalex.org/W1531368347","https://openalex.org/W1537470063","https://openalex.org/W1567308215","https://openalex.org/W1573288331","https://openalex.org/W1717854044","https://openalex.org/W1924552658","https://openalex.org/W1988083342","https://openalex.org/W1989312922","https://openalex.org/W1990313671","https://openalex.org/W2003159902","https://openalex.org/W2037971976","https://openalex.org/W2059453880","https://openalex.org/W2097113315","https://openalex.org/W2103132686","https://openalex.org/W2116634999","https://openalex.org/W2132489129","https://openalex.org/W2136320709","https://openalex.org/W2137360584","https://openalex.org/W2152221184","https://openalex.org/W2174973256","https://openalex.org/W2323554188","https://openalex.org/W2912720049","https://openalex.org/W3144422206","https://openalex.org/W4236563753","https://openalex.org/W4248275387"],"related_works":["https://openalex.org/W2617588251","https://openalex.org/W1856383708","https://openalex.org/W2793983771","https://openalex.org/W2753667555","https://openalex.org/W2911183586","https://openalex.org/W2806893870","https://openalex.org/W3003438657","https://openalex.org/W2650704808","https://openalex.org/W4391818465","https://openalex.org/W4288359146"],"abstract_inverted_index":{"Abstract":[0],"We":[1,88],"prove":[2],"that":[3,28],"the":[4,8,46,49,52,59,90,101,106],"problem":[5,96],"of":[6,20,64,76,81,103,105,108],"determining":[7],"minimum":[9],"propositional":[10],"proof":[11,35,70],"length":[12,71,107],"is":[13],"NP-hard":[14],"to":[15,69,100],"approximate":[16],"within":[17],"a":[18],"factor":[19],".":[21],"These":[22],"results":[23,66],"are":[24],"very":[25],"robust":[26],"in":[27],"they":[29],"hold":[30],"for":[31,83],"almost":[32],"all":[33],"natural":[34],"systems,":[36,39,42],"including:":[37],"Frege":[38,41],"extended":[40],"resolution.":[43],"Horn":[44],"resolution,":[45],"polynomial":[47,60],"calculus,":[48,51,55],"sequent":[50,54],"cut-free":[53],"as":[56,58],"well":[57],"calculus.":[61],"Our":[62],"hardness":[63],"approximation":[65,104],"usually":[67],"apply":[68],"measured":[72],"either":[73],"by":[74,79],"number":[75,80],"symbols":[77],"or":[78,85],"inferences,":[82],"tree-like":[84],"dag-like":[86],"proofs.":[87,109],"introduce":[89],"Monotone":[91],"Minimum":[92],"(Circuit)":[93],"Satisfying":[94],"Assignment":[95],"and":[97],"reduce":[98],"it":[99],"problems":[102]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}