{"id":"https://openalex.org/W323065768","doi":"https://doi.org/10.1007/978-3-642-22006-7_53","title":"Parameterized Bounded-Depth Frege Is Not Optimal","display_name":"Parameterized Bounded-Depth Frege Is Not Optimal","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W323065768","doi":"https://doi.org/10.1007/978-3-642-22006-7_53","mag":"323065768"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-22006-7_53","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-22006-7_53","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"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/A5042128349","display_name":"Olaf Beyersdorff","orcid":"https://orcid.org/0000-0002-2870-1648"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Olaf Beyersdorff","raw_affiliation_strings":["University of Leeds","(University of Leeds"],"affiliations":[{"raw_affiliation_string":"University of Leeds","institution_ids":["https://openalex.org/I130828816"]},{"raw_affiliation_string":"(University of Leeds","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084573067","display_name":"Nicola Galesi","orcid":"https://orcid.org/0000-0002-8522-362X"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Nicola Galesi","raw_affiliation_strings":["Sapienza University Rome","\u201cSapienza\u201d University Rome"],"affiliations":[{"raw_affiliation_string":"Sapienza University Rome","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"\u201cSapienza\u201d University Rome","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024267515","display_name":"Massimo Lauria","orcid":"https://orcid.org/0000-0003-4003-3168"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Massimo Lauria","raw_affiliation_strings":["Sapienza University Rome","\u201cSapienza\u201d University Rome"],"affiliations":[{"raw_affiliation_string":"Sapienza University Rome","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"\u201cSapienza\u201d University Rome","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008113826","display_name":"Alexander Razborov","orcid":null},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander A. Razborov","raw_affiliation_strings":["University of Chicago","University-of Chicago"],"affiliations":[{"raw_affiliation_string":"University of Chicago","institution_ids":["https://openalex.org/I40347166"]},{"raw_affiliation_string":"University-of Chicago","institution_ids":["https://openalex.org/I40347166"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5042128349"],"corresponding_institution_ids":["https://openalex.org/I130828816"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.01754588,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"4","issue":"3","first_page":"1","last_page":"16"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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.9986000061035156,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.9821431040763855},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7179007530212402},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.7035108804702759},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6373169422149658},{"id":"https://openalex.org/keywords/pigeonhole-principle","display_name":"Pigeonhole principle","score":0.6355529427528381},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6260467171669006},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5429009199142456},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.4936457872390747},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49145615100860596},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46619975566864014},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4272755980491638},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34964486956596375},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2665559947490692},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08320048451423645},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.07681894302368164},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06723523139953613},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06181558966636658}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9821431040763855},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7179007530212402},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.7035108804702759},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6373169422149658},{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.6355529427528381},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6260467171669006},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5429009199142456},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.4936457872390747},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49145615100860596},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46619975566864014},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4272755980491638},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34964486956596375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2665559947490692},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08320048451423645},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.07681894302368164},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06723523139953613},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06181558966636658},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1007/978-3-642-22006-7_53","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-22006-7_53","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"doi:10.1145/2355580.2355582","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2355580.2355582","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:eprints.whiterose.ac.uk:74772","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.225.6190","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.6190","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.cs.uchicago.edu/%7Erazborov/files/parres.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.297.4930","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.4930","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.cs.uchicago.edu/~razborov/files/parres.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.704.3975","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.704.3975","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csc.kth.se/%7Elauria/documents/para-bdfrege.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.718.1342","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.718.1342","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csc.kth.se/%7Ejakobn/project-proofcplx/docs/BGLR12ParameterizedBDF.pdf","raw_type":"text"},{"id":"pmh:oai:iris.uniroma1.it:11573/391744","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?eid=2-s2.0-79959940676&partnerID=65&md5=296103f7ca92d4fe579b90fe8e3d7b31","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:iris.uniroma1.it:11573/490888","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/490888","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"mag:323065768","is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/journals/eccc/eccc17.html#BeyersdorffGLR10","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1517036688","https://openalex.org/W1570425181","https://openalex.org/W1902951782","https://openalex.org/W1968584500","https://openalex.org/W1986272823","https://openalex.org/W1988083342","https://openalex.org/W1988772559","https://openalex.org/W1990604066","https://openalex.org/W2029390834","https://openalex.org/W2039982637","https://openalex.org/W2044095368","https://openalex.org/W2044722214","https://openalex.org/W2069767473","https://openalex.org/W2079758416","https://openalex.org/W2080763555","https://openalex.org/W2084029169","https://openalex.org/W2088421560","https://openalex.org/W2105786826","https://openalex.org/W2143382256","https://openalex.org/W2150936971","https://openalex.org/W2152390092","https://openalex.org/W2158029166","https://openalex.org/W2169713712","https://openalex.org/W2611922447","https://openalex.org/W2726059329","https://openalex.org/W2913688336","https://openalex.org/W4292230561","https://openalex.org/W6630973240"],"related_works":["https://openalex.org/W2092508401","https://openalex.org/W2150419136","https://openalex.org/W2023414599","https://openalex.org/W2177663427","https://openalex.org/W1505314344","https://openalex.org/W6135152","https://openalex.org/W2394942112","https://openalex.org/W3125502147","https://openalex.org/W2527679477","https://openalex.org/W1676006881","https://openalex.org/W2911549278","https://openalex.org/W2544182011","https://openalex.org/W2295286740","https://openalex.org/W2205189132","https://openalex.org/W1947598766","https://openalex.org/W2996877459","https://openalex.org/W3032361217","https://openalex.org/W2268573942","https://openalex.org/W3163884806","https://openalex.org/W2804646084"],"abstract_inverted_index":{"A":[0],"general":[1],"framework":[2],"for":[3,35,54,105,112,123],"parameterized":[4,23,56,76,139],"proof":[5,120],"complexity":[6,30],"was":[7],"introduced":[8],"by":[9,49],"Dantchev,":[10],"Martin,":[11],"and":[12],"Szeider":[13],"[9].":[14,95],"There":[15],"the":[16,42,66,97],"authors":[17],"concentrate":[18],"on":[19],"tree-like":[20,131],"Parameterized":[21,86,113,124,132],"Resolution\u2014a":[22],"version":[24,57],"of":[25,41,58,71,137],"classical":[26],"Resolution\u2014and":[27],"their":[28],"gap":[29],"theorem":[31],"implies":[32],"lower":[33,52],"bounds":[34,53],"that":[36,65,126,130],"system.":[37],"The":[38],"main":[39],"result":[40],"present":[43],"paper":[44],"significantly":[45],"improves":[46],"upon":[47],"this":[48],"showing":[50],"optimal":[51],"a":[55,81,102,109,119],"bounded-depth":[59,77],"Frege.":[60],"More":[61],"precisely,":[62],"we":[63,100],"prove":[64],"pigeonhole":[67],"principle":[68],"requires":[69],"proofs":[70],"size":[72],"n":[73],"\u03a9(k)":[74],"in":[75,84,94,127],"Frege,":[78],"and,":[79],"as":[80,108,142],"special":[82],"case,":[83],"dag-like":[85],"Resolution.":[87,114],"This":[88],"answers":[89],"an":[90],"open":[91],"question":[92],"posed":[93],"In":[96],"opposite":[98],"direction,":[99],"interpret":[101],"well-known":[103],"technique":[104],"FPT":[106],"algorithms":[107],"DPLL":[110],"procedure":[111],"Its":[115],"generalization":[116],"leads":[117],"to":[118],"search":[121],"algorithm":[122],"Resolution":[125,133],"particular":[128],"shows":[129],"allows":[134],"short":[135],"refutations":[136],"all":[138],"contradictions":[140],"given":[141],"bounded-width":[143],"CNF\u2019s.":[144]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}