{"id":"https://openalex.org/W2133705993","doi":"https://doi.org/10.1109/sfcs.2002.1181984","title":"Switching lemma for small restrictions and lower bounds for k-DNF resolution","display_name":"Switching lemma for small restrictions and lower bounds for k-DNF resolution","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2133705993","doi":"https://doi.org/10.1109/sfcs.2002.1181984","mag":"2133705993"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2002.1181984","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181984","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/content/qt5g36h6rk/qt5g36h6rk.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039320961","display_name":"Nathan Segerlind","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"N. Segerlind","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067079243","display_name":"Sam Buss","orcid":"https://orcid.org/0000-0003-3837-334X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Buss","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5002208831","display_name":"Russell Impagliazzo","orcid":"https://orcid.org/0000-0003-3236-9796"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Impagliazzo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6036,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.90567456,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"8","issue":null,"first_page":"604","last_page":"613"},"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.9983999729156494,"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.9983999729156494,"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.9977999925613403,"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.9936000108718872,"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.9623417258262634},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.7987679243087769},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7367309331893921},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7080956697463989},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.6917454600334167},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.677160918712616},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.5909513831138611},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.497360497713089},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49669724702835083},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.44096994400024414},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.41819724440574646},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1509552001953125},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10587233304977417}],"concepts":[{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.9623417258262634},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.7987679243087769},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7367309331893921},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7080956697463989},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.6917454600334167},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.677160918712616},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.5909513831138611},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.497360497713089},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49669724702835083},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.44096994400024414},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.41819724440574646},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1509552001953125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10587233304977417},{"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","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/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1109/sfcs.2002.1181984","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181984","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt5g36h6rk","is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/5g36h6rk","pdf_url":"https://escholarship.org/content/qt5g36h6rk/qt5g36h6rk.pdf","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, vol 33, iss 5","raw_type":"article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.64.3963","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.3963","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://euclid.ucsd.edu/~sbuss/ResearchWeb/resK/resKSIAM.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.74.294","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.294","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://euclid.ucsd.edu/~sbuss/ResearchWeb/resK/focs02.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.8579","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.8579","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://euclid.ucsd.edu/~sbuss/ResearchWeb/resK/resKSIAM.ps","raw_type":"text"},{"id":"pmh:qt5g36h6rk","is_oa":false,"landing_page_url":"http://www.escholarship.org/uc/item/5g36h6rk","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Segerlind, Nate; Buss, Sam; & Impagliazzo, Russell. (2004). A switching lemma for small restrictions and lower bounds for k-DNF resolution. SIAM Journal on Computing, 33(5), 1171 - 1200. UC San Diego: Retrieved from: http://www.escholarship.org/uc/item/5g36h6rk","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:escholarship.org/ark:/13030/qt5g36h6rk","is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/5g36h6rk","pdf_url":"https://escholarship.org/content/qt5g36h6rk/qt5g36h6rk.pdf","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, vol 33, iss 5","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2133705993.pdf"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W157950381","https://openalex.org/W1517180214","https://openalex.org/W1521859395","https://openalex.org/W1567053297","https://openalex.org/W1571909284","https://openalex.org/W1575886793","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/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/W2088616860","https://openalex.org/W2090339500","https://openalex.org/W2095226356","https://openalex.org/W2097113315","https://openalex.org/W2098022011","https://openalex.org/W2102977254","https://openalex.org/W2122055721","https://openalex.org/W2126420408","https://openalex.org/W2143313747","https://openalex.org/W2159170152","https://openalex.org/W2163996090","https://openalex.org/W2165293955","https://openalex.org/W2175296692","https://openalex.org/W2295428206","https://openalex.org/W2407913417","https://openalex.org/W2575861945","https://openalex.org/W2908059907","https://openalex.org/W6606399963","https://openalex.org/W6634145069","https://openalex.org/W6684118907"],"related_works":["https://openalex.org/W1902951782","https://openalex.org/W1521859395","https://openalex.org/W2041857712","https://openalex.org/W2097425413","https://openalex.org/W1974091179","https://openalex.org/W2183083419","https://openalex.org/W2963861452","https://openalex.org/W2888365070","https://openalex.org/W4297780507","https://openalex.org/W4376143232"],"abstract_inverted_index":{"We":[0,27,51],"prove":[1,31],"a":[2,13,110],"new":[3],"switching":[4],"lemma":[5],"that":[6,10,116],"works":[7,45],"for":[8,34,75,93],"restrictions":[9],"set":[11],"only":[12],"small":[14,25],"fraction":[15],"of":[16,42,49,61,69,134],"the":[17,35],"variables":[18],"and":[19,65],"is":[20],"applicable":[21],"to":[22,30,81,89,122],"DNFs":[23],"with":[24,46],"conjunctions.":[26],"use":[28],"this":[29],"lower":[32],"bounds":[33],"Res(k)":[36,76,147],"propositional":[37],"proof":[38],"system,":[39],"an":[40,54],"extension":[41],"resolution":[43],"which":[44,136,143],"k-DNFs":[47],"instead":[48],"clauses.":[50],"also":[52],"obtain":[53],"exponential":[55,87,120,145],"separation":[56],"between":[57],"depth":[58,66],"d":[59,67],"circuits":[60,68],"bottom":[62,70],"fan-in":[63,71],"k":[64,94,114],"k+1.":[72],"Our":[73],"results":[74],"are:":[77],"1.":[78],"The":[79],"2n":[80],"n":[82],"weak":[83],"pigeonhole":[84],"principle":[85],"requires":[86],"size":[88,121,139,146],"refute":[90,123],"in":[91,124],"Res(k),":[92],"/spl":[95,97],"les/":[96],"radic/(log":[98],"n/":[99],"log":[100,101],"n).":[102],"2.":[103],"For":[104,127],"each":[105,128],"constant":[106,111,129],"k,":[107,130],"there":[108,131],"exists":[109],"w":[112],">":[113],"so":[115],"random":[117],"w-CNFs":[118],"require":[119,144],"Res(k).":[125],"3.":[126],"are":[132],"sets":[133],"clauses":[135],"have":[137],"polynomial":[138],"Res(k+1)":[140],"refutations,":[141],"but":[142],"refutations.":[148]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}