{"id":"https://openalex.org/W1997643965","doi":"https://doi.org/10.1145/1706591.1706594","title":"Amplifying lower bounds by means of self-reducibility","display_name":"Amplifying lower bounds by means of self-reducibility","publication_year":2010,"publication_date":"2010-03-01","ids":{"openalex":"https://openalex.org/W1997643965","doi":"https://doi.org/10.1145/1706591.1706594","mag":"1997643965"},"language":"en","primary_location":{"id":"doi:10.1145/1706591.1706594","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1706591.1706594","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","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/A5078734824","display_name":"Eric Allender","orcid":"https://orcid.org/0000-0002-0650-028X"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Eric Allender","raw_affiliation_strings":["Rutgers University, Rutgers, New Jersey, New Brunswick, NJ"],"affiliations":[{"raw_affiliation_string":"Rutgers University, Rutgers, New Jersey, New Brunswick, NJ","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040922782","display_name":"Michal Kouck\u00fd","orcid":"https://orcid.org/0000-0003-0808-2269"},"institutions":[{"id":"https://openalex.org/I202391551","display_name":"Czech Academy of Sciences","ror":"https://ror.org/053avzc18","country_code":"CZ","type":"funder","lineage":["https://openalex.org/I202391551"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Michal Kouck\u00fd","raw_affiliation_strings":["Academy of Sciences of the Czech Republic, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Academy of Sciences of the Czech Republic, Prague, Czech Republic","institution_ids":["https://openalex.org/I202391551"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078734824"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":4.4821,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.94405751,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"57","issue":"3","first_page":"1","last_page":"36"},"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.9998999834060669,"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.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","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"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9958000183105469,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7219561338424683},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.7020193934440613},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6260908842086792},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6115584373474121},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.5907008051872253},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.582273006439209},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.5765655040740967},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5697514414787292},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.5360828638076782},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5341632962226868},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.5267521739006042},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5014636516571045},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4814252555370331},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4536953270435333},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2596503794193268},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.14676520228385925},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.14195382595062256},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.08802145719528198}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7219561338424683},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7020193934440613},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6260908842086792},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6115584373474121},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.5907008051872253},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.582273006439209},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.5765655040740967},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5697514414787292},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5360828638076782},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5341632962226868},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5267521739006042},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5014636516571045},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4814252555370331},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4536953270435333},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2596503794193268},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.14676520228385925},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.14195382595062256},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.08802145719528198},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"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.1145/1706591.1706594","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1706591.1706594","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:alma.01RUT_INST:11663533320004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/journalArticle/Amplifying-lower-bounds-by-means-of/991031654702704646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:asep.lib.cas.cz:CavUnEpca/0352511","is_oa":false,"landing_page_url":"http://hdl.handle.net/11104/0192003","pdf_url":null,"source":{"id":"https://openalex.org/S7407055266","display_name":"ASEP","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4868864789","display_name":null,"funder_award_id":"CCF-05147093","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G5392902359","display_name":null,"funder_award_id":"CCF-0514155DMS-0652582CCF-0830133CCF-0832787","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G7134441321","display_name":null,"funder_award_id":"GA\u010cR 201/07/P276P202/10/0854","funder_id":"https://openalex.org/F4320321005","funder_display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy"}],"funders":[{"id":"https://openalex.org/F4320321005","display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","ror":"https://ror.org/037n8p820"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":65,"referenced_works":["https://openalex.org/W41330591","https://openalex.org/W115737229","https://openalex.org/W136048902","https://openalex.org/W145878737","https://openalex.org/W1483324665","https://openalex.org/W1484932907","https://openalex.org/W1490189322","https://openalex.org/W1500453128","https://openalex.org/W1524205832","https://openalex.org/W1551833159","https://openalex.org/W1577741814","https://openalex.org/W1882041575","https://openalex.org/W1975124543","https://openalex.org/W1984459117","https://openalex.org/W1988762827","https://openalex.org/W1991188222","https://openalex.org/W2001187993","https://openalex.org/W2004974518","https://openalex.org/W2005223599","https://openalex.org/W2007483355","https://openalex.org/W2010873187","https://openalex.org/W2015895898","https://openalex.org/W2017205387","https://openalex.org/W2017290750","https://openalex.org/W2024091095","https://openalex.org/W2027501230","https://openalex.org/W2031713274","https://openalex.org/W2037281399","https://openalex.org/W2038247515","https://openalex.org/W2042194938","https://openalex.org/W2045583484","https://openalex.org/W2045924252","https://openalex.org/W2046812405","https://openalex.org/W2054013713","https://openalex.org/W2056994701","https://openalex.org/W2058422149","https://openalex.org/W2060270693","https://openalex.org/W2068638452","https://openalex.org/W2069864904","https://openalex.org/W2070678975","https://openalex.org/W2081254453","https://openalex.org/W2104952158","https://openalex.org/W2105859078","https://openalex.org/W2111385661","https://openalex.org/W2111642906","https://openalex.org/W2117427692","https://openalex.org/W2124218043","https://openalex.org/W2124296012","https://openalex.org/W2132991500","https://openalex.org/W2133034393","https://openalex.org/W2140270919","https://openalex.org/W2141836042","https://openalex.org/W2146207150","https://openalex.org/W2167785416","https://openalex.org/W2480498821","https://openalex.org/W2561675875","https://openalex.org/W2610183793","https://openalex.org/W2612879297","https://openalex.org/W2912080987","https://openalex.org/W3141816077","https://openalex.org/W4212838967","https://openalex.org/W4240781210","https://openalex.org/W6601718084","https://openalex.org/W6629080625","https://openalex.org/W6921393794"],"related_works":["https://openalex.org/W2009341260","https://openalex.org/W3204916073","https://openalex.org/W2952185983","https://openalex.org/W2055594799","https://openalex.org/W2403507963","https://openalex.org/W2611822924","https://openalex.org/W2486254595","https://openalex.org/W2799890067","https://openalex.org/W1492165320","https://openalex.org/W3046459465"],"abstract_inverted_index":{"We":[0,15,166,220,240],"observe":[1],"that":[2,101,126,140,159,168,223,232,252],"many":[3],"important":[4],"computational":[5],"problems":[6,224],"in":[7,55],"NC":[8,83,163,209],"1":[9,84,164,210],"share":[10],"a":[11,56,93],"simple":[12],"self-reducibility":[13,25,88],"property.":[14,89],"then":[16,155,241],"show":[17,125,167,222,251],"that,":[18],"for":[19,46,82,198,270],"any":[20],"problem":[21,77],"A":[22,27],"having":[23],"this":[24,69,121],"property,":[26],"has":[28,38,86,148],"polynomial-size":[29],"TC":[30,39,106,142,160,206,258],"0":[31,40,49,107,132,143,161,204,207,259,262],"circuits":[32,41,108,229,264],"if":[33,36],"and":[34,85,99,188,190,208,237,260],"only":[35],"it":[37,156],"of":[42,53,61,67,96,109,134,172,186,244,265],"size":[43,60,110,149,266],"n":[44,111,152,175,267],"1+\u03f5":[45,112,153,176],"every":[47,141],"\u03f5>":[48,131],"(counting":[50],"the":[51,59,62,73,87,135,173,182],"number":[52],"wires":[54],"circuit":[57,144,217],"as":[58,202],"circuit).":[63],"As":[64],"an":[65],"example":[66],"what":[68],"observation":[70],"yields,":[71],"consider":[72],"Boolean":[74],"Formula":[75],"Evaluation":[76],"(BFE),":[78],"which":[79],"is":[80,128,177,193],"complete":[81],"It":[90],"follows":[91],"from":[92],"lower":[94,122,170,218,248],"bound":[95,123],"Impagliazzo,":[97],"Paturi,":[98],"Saks,":[100],"BFE":[102,147],"requires":[103,254],"depth":[104,136,256],"d":[105,113,137,257,276],".":[114,165,277],"If":[115],"one":[116],"were":[117],"able":[118],"to":[119,124,215,250],"improve":[120],"there":[127,192],"some":[129,271],"constant":[130,272],"(independent":[133],")":[138],"such":[139,201],"family":[145],"recognizing":[146],"at":[150],"least":[151],",":[154,205],"would":[157],"follow":[158],"\u2260":[162],"proving":[169,216],"bounds":[171,249],"form":[174],"not":[178],"ruled":[179],"out":[180],"by":[181],"Natural":[183],"Proof":[184],"framework":[185],"Razborov":[187],"Rudich":[189],"hence":[191],"currently":[194],"no":[195],"known":[196,245],"barrier":[197],"separating":[199],"classes":[200],"ACC":[203],"via":[211],"existing":[212],"\u201cnatural\u201d":[213],"approaches":[214],"bounds.":[219,239],"also":[221],"with":[225],"small":[226,235],"uniform":[227,255],"constant-depth":[228],"have":[230,234],"algorithms":[231],"simultaneously":[233],"space":[236],"time":[238],"make":[242],"use":[243],"time-space":[246],"tradeoff":[247],"SAT":[253],"AC":[261],"[6]":[263],"1+":[268],"c":[269,273],"depending":[274],"on":[275]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}