{"id":"https://openalex.org/W2151373762","doi":"https://doi.org/10.1137/s0097539703433146","title":"Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles","display_name":"Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles","publication_year":2004,"publication_date":"2004-12-10","ids":{"openalex":"https://openalex.org/W2151373762","doi":"https://doi.org/10.1137/s0097539703433146","mag":"2151373762"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539703433146","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703433146","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5111965869","display_name":"Joshua Buresh-Oppenheim","orcid":null},"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":true,"raw_author_name":"Joshua Buresh-Oppenheim","raw_affiliation_strings":["University of Toronto"],"affiliations":[{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042076941","display_name":"Paul Beame","orcid":"https://orcid.org/0000-0002-2666-3545"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul Beame","raw_affiliation_strings":["University of Washington ;"],"affiliations":[{"raw_affiliation_string":"University of Washington ;","institution_ids":["https://openalex.org/I201448701"]}]},{"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/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":"Toniann Pitassi","raw_affiliation_strings":["University of Toronto"],"affiliations":[{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","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":["Weizmann institute of science;"],"affiliations":[{"raw_affiliation_string":"Weizmann institute of science;","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077726785","display_name":"Ashish Sabharwal","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ashish Sabharwal","raw_affiliation_strings":["University of Washington ;"],"affiliations":[{"raw_affiliation_string":"University of Washington ;","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5111965869"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":0.3371,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63536758,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":"2","first_page":"261","last_page":"276"},"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.9998000264167786,"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.9998000264167786,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9961000084877014,"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/T10126","display_name":"Logic, programming, and type systems","score":0.992900013923645,"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/pigeonhole-principle","display_name":"Pigeonhole principle","score":0.977341890335083},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.8292728662490845},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7637381553649902},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.7467023134231567},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7408333420753479},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7114702463150024},{"id":"https://openalex.org/keywords/tautology","display_name":"Tautology (logic)","score":0.6234843134880066},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5098125338554382},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4925130307674408},{"id":"https://openalex.org/keywords/argument","display_name":"Argument (complex analysis)","score":0.48746728897094727},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.41298046708106995},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10816675424575806},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08117330074310303}],"concepts":[{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.977341890335083},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8292728662490845},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7637381553649902},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.7467023134231567},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7408333420753479},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7114702463150024},{"id":"https://openalex.org/C166374712","wikidata":"https://www.wikidata.org/wiki/Q209555","display_name":"Tautology (logic)","level":5,"score":0.6234843134880066},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5098125338554382},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4925130307674408},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.48746728897094727},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.41298046708106995},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10816675424575806},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08117330074310303},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C3845977","wikidata":"https://www.wikidata.org/wiki/Q4826262","display_name":"Autoepistemic logic","level":4,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539703433146","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703433146","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":14,"referenced_works":["https://openalex.org/W1503753783","https://openalex.org/W1968584500","https://openalex.org/W2029390834","https://openalex.org/W2036656440","https://openalex.org/W2060270693","https://openalex.org/W2062912795","https://openalex.org/W2069767473","https://openalex.org/W2075146634","https://openalex.org/W2088421560","https://openalex.org/W2089534194","https://openalex.org/W2137423523","https://openalex.org/W2169713712","https://openalex.org/W2170605748","https://openalex.org/W4248733413"],"related_works":["https://openalex.org/W1998171255","https://openalex.org/W4288055874","https://openalex.org/W1662675122","https://openalex.org/W2068071783","https://openalex.org/W3013031282","https://openalex.org/W2531336559","https://openalex.org/W2098308941","https://openalex.org/W2099785256","https://openalex.org/W2165390183","https://openalex.org/W2159783982"],"abstract_inverted_index":{"We":[0],"prove":[1],"a":[2,40],"quasi-polynomial":[3],"lower":[4,23,46],"bound":[5,24],"on":[6],"the":[7,14,27,56,68],"size":[8],"of":[9,13],"bounded-depth":[10,30,49],"Frege":[11,31,50],"proofs":[12,32],"pigeonhole":[15],"principle":[16],"$PHP^{m}_n$":[17],"where":[18],"$m=":[19],"(1+1/{\u00edpolylog":[20],"n})n$.":[21],"This":[22],"qualitatively":[25],"matches":[26],"known":[28],"quasi-polynomial-size":[29],"for":[33,48],"these":[34],"principles.":[35],"Our":[36],"technique,":[37],"which":[38,59],"uses":[39],"switching":[41,61],"lemma":[42,62],"argument":[43],"like":[44],"other":[45],"bounds":[47],"proofs,":[51],"is":[52,63],"novel":[53],"in":[54],"that":[55],"tautology":[57],"to":[58],"this":[60],"applied":[64],"remains":[65],"random":[66],"throughout":[67],"argument.":[69]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}