{"id":"https://openalex.org/W1990362734","doi":"https://doi.org/10.1145/1740582.1740587","title":"Lower bounds for bounded depth Frege proofs via Pudl\u00e1k-Buss games","display_name":"Lower bounds for bounded depth Frege proofs via Pudl\u00e1k-Buss games","publication_year":2010,"publication_date":"2010-05-01","ids":{"openalex":"https://openalex.org/W1990362734","doi":"https://doi.org/10.1145/1740582.1740587","mag":"1990362734"},"language":"en","primary_location":{"id":"doi:10.1145/1740582.1740587","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1740582.1740587","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational 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/A5058111762","display_name":"Eli Ben\u2010Sasson","orcid":"https://orcid.org/0000-0002-0708-0483"},"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":"Eli Ben-Sasson","raw_affiliation_strings":["Technion, Haifa, Israel","Technion , Haifa , Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion , Haifa , Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019248097","display_name":"Prahladh Harsha","orcid":"https://orcid.org/0000-0002-2739-5642"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Prahladh Harsha","raw_affiliation_strings":["Tata Institute of Fundamental Research, Mumbai, India","Tata Institute of Fundamental Research, Mumbai, India.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research, Mumbai, India","institution_ids":["https://openalex.org/I11947397"]},{"raw_affiliation_string":"Tata Institute of Fundamental Research, Mumbai, India.#TAB#","institution_ids":["https://openalex.org/I11947397"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.08629151,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"11","issue":"3","first_page":"1","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9995999932289124,"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.9994999766349792,"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.9988999962806702,"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/mathematical-proof","display_name":"Mathematical proof","score":0.8548363447189331},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.8259836435317993},{"id":"https://openalex.org/keywords/pigeonhole-principle","display_name":"Pigeonhole principle","score":0.7117819786071777},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6868508458137512},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6249459981918335},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5974950194358826},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5916481018066406},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.49565064907073975},{"id":"https://openalex.org/keywords/intuition","display_name":"Intuition","score":0.4895821511745453},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4598980247974396},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45428988337516785},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3392837643623352},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2110062837600708},{"id":"https://openalex.org/keywords/epistemology","display_name":"Epistemology","score":0.061979860067367554}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8548363447189331},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.8259836435317993},{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.7117819786071777},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6868508458137512},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6249459981918335},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5974950194358826},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5916481018066406},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.49565064907073975},{"id":"https://openalex.org/C132010649","wikidata":"https://www.wikidata.org/wiki/Q189222","display_name":"Intuition","level":2,"score":0.4895821511745453},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4598980247974396},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45428988337516785},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3392837643623352},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2110062837600708},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.061979860067367554},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1740582.1740587","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1740582.1740587","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational 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":21,"referenced_works":["https://openalex.org/W619004858","https://openalex.org/W1563012911","https://openalex.org/W1567556115","https://openalex.org/W1607926272","https://openalex.org/W1968655942","https://openalex.org/W1988083342","https://openalex.org/W2014850486","https://openalex.org/W2029390834","https://openalex.org/W2036656440","https://openalex.org/W2060270693","https://openalex.org/W2069767473","https://openalex.org/W2075146634","https://openalex.org/W2089534194","https://openalex.org/W2093396771","https://openalex.org/W2109174551","https://openalex.org/W2135672707","https://openalex.org/W2151373762","https://openalex.org/W2165293955","https://openalex.org/W2167115661","https://openalex.org/W2169713712","https://openalex.org/W2175296692"],"related_works":["https://openalex.org/W4288055874","https://openalex.org/W1662675122","https://openalex.org/W2068071783","https://openalex.org/W2531336559","https://openalex.org/W3013031282","https://openalex.org/W2099785256","https://openalex.org/W2075906306","https://openalex.org/W187835144","https://openalex.org/W2063658344","https://openalex.org/W2165390183"],"abstract_inverted_index":{"We":[0,89],"present":[1],"a":[2],"simple":[3],"proof":[4,9,101],"of":[5,12,31,64,72],"the":[6,23,29,62,69,84],"bounded-depth":[7],"Frege":[8],"lower":[10,43,70],"bounds":[11],"Pitassi":[13,73],"et":[14,19,74,79],"al.":[15,20,75,80],"[1993]":[16,76],"and":[17,40,51,55,77],"Kraj\u00ed\u010dek":[18,78],"[1995]":[21,81],"for":[22,98],"pigeonhole":[24],"principle.":[25],"Our":[26,42],"method":[27],"uses":[28],"interpretation":[30],"proofs":[32],"as":[33],"two":[34],"player":[35],"games":[36],"given":[37],"by":[38],"Pudl\u00e1k":[39],"Buss.":[41],"bound":[44,71],"is":[45],"conceptually":[46],"simpler":[47],"than":[48],"previous":[49],"ones,":[50],"relies":[52],"on":[53],"tools":[54],"intuition":[56],"that":[57],"are":[58],"well":[59],"known":[60],"in":[61,100],"context":[63],"computational":[65,86],"complexity.":[66,102],"This":[67],"makes":[68],"accessible":[82],"to":[83],"general":[85],"complexity":[87],"audience.":[88],"hope":[90],"this":[91],"new":[92,96],"view":[93],"will":[94],"open":[95],"directions":[97],"research":[99]},"counts_by_year":[{"year":2019,"cited_by_count":27},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}