{"id":"https://openalex.org/W2137423523","doi":"https://doi.org/10.1137/s0097539703428555","title":"A Switching Lemma for Small Restrictions and Lower Bounds for <i>k</i>-DNF Resolution","display_name":"A Switching Lemma for Small Restrictions and Lower Bounds for <i>k</i>-DNF Resolution","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2137423523","doi":"https://doi.org/10.1137/s0097539703428555","mag":"2137423523"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539703428555","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703428555","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/A5039320961","display_name":"Nathan Segerlind","orcid":null},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nathan Segerlind","raw_affiliation_strings":["School of Mathematics, Institute for Advanced Study, Einstein Drive, Princeton, NJ 08540"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, Institute for Advanced Study, Einstein Drive, Princeton, NJ 08540","institution_ids":["https://openalex.org/I40036882"]}]},{"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sam Buss","raw_affiliation_strings":["Department of Mathematics, University of California, San Diego, La Jolla, CA 92092-0112"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of California, San Diego, La Jolla, CA 92092-0112","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002208831","display_name":"Russell Impagliazzo","orcid":"https://orcid.org/0000-0003-3236-9796"},"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Russell Impagliazzo","raw_affiliation_strings":["Department of Computer Science, University of California, San Diego, La Jolla, CA 92092-0112"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, San Diego, La Jolla, CA 92092-0112","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.8136,"has_fulltext":false,"cited_by_count":77,"citation_normalized_percentile":{"value":0.9646647,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"33","issue":"5","first_page":"1171","last_page":"1200"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"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.9987000226974487,"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.9578831791877747},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.8105139136314392},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8075876832008362},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7294328212738037},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.6816411018371582},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6724411249160767},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.6276947259902954},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5091678500175476},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47214749455451965},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4475671052932739},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.43445801734924316},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.16638681292533875}],"concepts":[{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.9578831791877747},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.8105139136314392},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8075876832008362},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7294328212738037},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.6816411018371582},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6724411249160767},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.6276947259902954},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5091678500175476},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47214749455451965},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4475671052932739},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.43445801734924316},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.16638681292533875},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0},{"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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},{"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/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539703428555","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703428555","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":[{"id":"https://openalex.org/G1108427843","display_name":"Proof Theory and Computational Complexity","funder_award_id":"0100589","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1851380437","display_name":"Quantifying Intractability and the Complexity of Heuristics","funder_award_id":"0098197","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1571909284","https://openalex.org/W1600475114","https://openalex.org/W1607926272","https://openalex.org/W1970755596","https://openalex.org/W1984645675","https://openalex.org/W1988083342","https://openalex.org/W2006367699","https://openalex.org/W2016341899","https://openalex.org/W2026967932","https://openalex.org/W2036656440","https://openalex.org/W2041857712","https://openalex.org/W2044722214","https://openalex.org/W2060270693","https://openalex.org/W2062912795","https://openalex.org/W2069767473","https://openalex.org/W2076663305","https://openalex.org/W2084384424","https://openalex.org/W2090339500","https://openalex.org/W2095226356","https://openalex.org/W2098022011","https://openalex.org/W2102977254","https://openalex.org/W2122055721","https://openalex.org/W2126420408","https://openalex.org/W2133705993","https://openalex.org/W2137423523","https://openalex.org/W2143313747","https://openalex.org/W2159170152","https://openalex.org/W2163996090","https://openalex.org/W2175296692","https://openalex.org/W2295428206","https://openalex.org/W2498145201","https://openalex.org/W2908059907","https://openalex.org/W2985554528","https://openalex.org/W4213091458","https://openalex.org/W4229606576","https://openalex.org/W4231916799","https://openalex.org/W4248733413","https://openalex.org/W4250886557"],"related_works":["https://openalex.org/W1902951782","https://openalex.org/W2041857712","https://openalex.org/W1521859395","https://openalex.org/W256057417","https://openalex.org/W2097425413","https://openalex.org/W2183083419","https://openalex.org/W2963861452","https://openalex.org/W4297780507","https://openalex.org/W2888365070","https://openalex.org/W4376143232"],"abstract_inverted_index":{"We":[0,32,56],"prove":[1,36],"a":[2,13,117],"new":[3],"switching":[4],"lemma":[5],"that":[6,10,123],"works":[7,50],"for":[8,39,82,100],"restrictions":[9],"set":[11],"only":[12],"small":[14,30],"fraction":[15],"of":[16,47,54,66,74,140],"the":[17,40],"variables":[18],"and":[19,70],"is":[20],"applicable":[21],"to":[22,35,88,96,129],"formulas":[23],"in":[24,98,131],"disjunctive":[25],"normal":[26],"form":[27],"(DNFs)":[28],"with":[29,51],"terms.":[31],"use":[33],"this":[34],"lower":[37],"bounds":[38],"Res(k)":[41,83,99,155],"propositional":[42],"proof":[43],"system,":[44],"an":[45,59],"extension":[46],"resolution":[48],"which":[49,142,151],"k-DNFs":[52],"instead":[53],"clauses.":[55],"also":[57],"obtain":[58],"exponential":[60,94,127,153],"separation":[61],"between":[62],"depth":[63,71],"d":[64,72],"circuits":[65,73],"bottom":[67,75],"fan-in":[68,76],"k":[69,77,121],"+":[78,147],"1.":[79],"Our":[80],"results":[81],"are":[84,138],"as":[85],"follows:The":[86],"2n":[87],"n":[89,104,108],"weak":[90],"pigeonhole":[91],"principle":[92],"requires":[93],"size":[95,128,145,154],"refute":[97,130],"$k":[101],"\\leq":[102],"\\sqrt{\\log":[103],"/":[105],"\\log":[106,107],"}":[109],"$.":[110],"For":[111,133],"each":[112,134],"constant":[113,118,135],"k,":[114,136],"there":[115,137],"exists":[116],"w":[119],">":[120],"so":[122],"random":[124],"w-CNFs":[125],"require":[126,152],"Res(k).":[132],"sets":[139],"clauses":[141],"have":[143],"polynomial":[144],"Res(k":[146],"1)":[148],"refutations":[149],"but":[150],"refutations.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}