{"id":"https://openalex.org/W300103453","doi":"https://doi.org/10.1002/rsa.3240070103","title":"An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle","display_name":"An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle","publication_year":1995,"publication_date":"1995-08-01","ids":{"openalex":"https://openalex.org/W300103453","doi":"https://doi.org/10.1002/rsa.3240070103","mag":"300103453"},"language":"en","primary_location":{"id":"doi:10.1002/rsa.3240070103","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.3240070103","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures & Algorithms","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/A5069803587","display_name":"Jan Kraj\u0131\u0301\u010dek","orcid":"https://orcid.org/0000-0003-0670-3957"},"institutions":[{"id":"https://openalex.org/I4210120266","display_name":"Czech Academy of Sciences, Institute of Mathematics","ror":"https://ror.org/02tv1yf50","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210120266"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jan Kraj\u00ed\u010dek","raw_affiliation_strings":["Mathematical Institute AVC\u030cR, Z\u030citna\u0301 25, Praha 1, 115 67, Czech Republic","Mathematical Institute AV\u010cR, \u017ditn\u00e1 25, Praha 1, 115 67, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Mathematical Institute AVC\u030cR, Z\u030citna\u0301 25, Praha 1, 115 67, Czech Republic","institution_ids":["https://openalex.org/I4210120266"]},{"raw_affiliation_string":"Mathematical Institute AV\u010cR, \u017ditn\u00e1 25, Praha 1, 115 67, Czech Republic","institution_ids":["https://openalex.org/I4210120266"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109848440","display_name":"Pavel Pudl\u00e1k","orcid":null},"institutions":[{"id":"https://openalex.org/I4210120266","display_name":"Czech Academy of Sciences, Institute of Mathematics","ror":"https://ror.org/02tv1yf50","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210120266"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Pavel Pudl\u00e1k","raw_affiliation_strings":["Mathematical Institute AVC\u030cR, Z\u030citna\u0301 25, Praha 1, 115 67, Czech Republic","Mathematical Institute AV\u010cR, \u017ditn\u00e1 25, Praha 1, 115 67, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Mathematical Institute AVC\u030cR, Z\u030citna\u0301 25, Praha 1, 115 67, Czech Republic","institution_ids":["https://openalex.org/I4210120266"]},{"raw_affiliation_string":"Mathematical Institute AV\u010cR, \u017ditn\u00e1 25, Praha 1, 115 67, Czech Republic","institution_ids":["https://openalex.org/I4210120266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080340008","display_name":"Alan R. Woods","orcid":null},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Alan Woods","raw_affiliation_strings":["Department of Mathematics, University of Western Australia, WA 6009, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Western Australia, WA 6009, Australia","institution_ids":["https://openalex.org/I177877127"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5069803587"],"corresponding_institution_ids":["https://openalex.org/I4210120266"],"apc_list":{"value":4330,"currency":"USD","value_usd":4330},"apc_paid":null,"fwci":1.042,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.7204139,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":"1","first_page":"15","last_page":"39"},"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.9958000183105469,"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.9958000183105469,"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/T11567","display_name":"semigroups and automata theory","score":0.9714999794960022,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9684000015258789,"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/pigeonhole-principle","display_name":"Pigeonhole principle","score":0.9818376302719116},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.856024980545044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7344464063644409},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6958469152450562},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6748489141464233},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.6613478660583496},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5242422223091125},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5216870307922363},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4586576819419861},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4560615122318268},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11937928199768066},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09928557276725769},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.055079489946365356}],"concepts":[{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.9818376302719116},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.856024980545044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7344464063644409},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6958469152450562},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6748489141464233},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.6613478660583496},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5242422223091125},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5216870307922363},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4586576819419861},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4560615122318268},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11937928199768066},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09928557276725769},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.055079489946365356},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1002/rsa.3240070103","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.3240070103","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures & Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.54.872","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.872","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.maths.ox.ac.uk/~krajicek/php.ps.gz","raw_type":"text"},{"id":"mag:300103453","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc1.html#ECCC-TR94-018","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1572440476","https://openalex.org/W1572451808","https://openalex.org/W1968584500","https://openalex.org/W1988083342","https://openalex.org/W2029390834","https://openalex.org/W2036265926","https://openalex.org/W2036656440","https://openalex.org/W2045924252","https://openalex.org/W2069767473","https://openalex.org/W2098225435","https://openalex.org/W2109174551","https://openalex.org/W2114817374","https://openalex.org/W2135672707","https://openalex.org/W2167115661","https://openalex.org/W2170605748","https://openalex.org/W4245630182"],"related_works":["https://openalex.org/W2169713712","https://openalex.org/W2109174551","https://openalex.org/W2151373762","https://openalex.org/W2105447726","https://openalex.org/W2039982637","https://openalex.org/W2035926913","https://openalex.org/W1662675122","https://openalex.org/W256057417","https://openalex.org/W2130864840","https://openalex.org/W3013031282","https://openalex.org/W2146100374","https://openalex.org/W3028950990","https://openalex.org/W3214059917","https://openalex.org/W2407569303","https://openalex.org/W1988083342","https://openalex.org/W2767976260","https://openalex.org/W2950999115","https://openalex.org/W2730643286","https://openalex.org/W2953277489","https://openalex.org/W3113860026"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"prove":[2],"lower":[3,50,61],"bounds":[4,62],"of":[5,20,22,26,38],"the":[6,18,30,48,53],"form":[7],"exp(":[8],"n":[9],"\u03b5":[10,13],"d":[11,14,40],"),":[12],">":[15],"0,":[16],"on":[17,29],"length":[19],"proofs":[21],"an":[23],"explicit":[24],"sequence":[25],"tautologies,":[27],"based":[28],"Pigeonhole":[31],"Principle,":[32],"in":[33],"proof":[34,55],"systems":[35],"using":[36],"formulas":[37],"depth":[39],",":[41],"for":[42,52,57],"any":[43,59],"constant":[44],"d.":[45],"This":[46],"is":[47],"largest":[49],"bound":[51],"strongest":[54],"system,":[56],"which":[58],"superpolynomial":[60],"are":[63],"known.":[64]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}