{"id":"https://openalex.org/W2000159558","doi":"https://doi.org/10.1109/ccc.2009.21","title":"Fixed-Polynomial Size Circuit Bounds","display_name":"Fixed-Polynomial Size Circuit Bounds","publication_year":2009,"publication_date":"2009-07-01","ids":{"openalex":"https://openalex.org/W2000159558","doi":"https://doi.org/10.1109/ccc.2009.21","mag":"2000159558"},"language":"en","primary_location":{"id":"doi:10.1109/ccc.2009.21","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2009.21","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 24th Annual IEEE Conference on Computational Complexity","raw_type":"proceedings-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/A5075191567","display_name":"Lance Fortnow","orcid":"https://orcid.org/0000-0002-2020-1358"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lance Fortnow","raw_affiliation_strings":["Northwestern University, Evanston, IL, USA"],"affiliations":[{"raw_affiliation_string":"Northwestern University, Evanston, IL, USA","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085864294","display_name":"Rahul Santhanam","orcid":"https://orcid.org/0000-0002-8716-6091"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rahul Santhanam","raw_affiliation_strings":["University of Edinburgh, Edinburgh, UK","School of Informatics"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"School of Informatics","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"Ryan Williams","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":"Ryan Williams","raw_affiliation_strings":["Institute of Advanced Study, Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Institute of Advanced Study, Princeton, NJ, USA","institution_ids":["https://openalex.org/I40036882"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5075191567"],"corresponding_institution_ids":["https://openalex.org/I111979921"],"apc_list":null,"apc_paid":null,"fwci":0.33415375,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.66418325,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":"157","first_page":"19","last_page":"26"},"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.9988999962806702,"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/polynomial","display_name":"Polynomial","score":0.5763875842094421},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4587254226207733},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40205276012420654},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36443954706192017},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3456661105155945},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1359502077102661}],"concepts":[{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5763875842094421},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4587254226207733},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40205276012420654},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36443954706192017},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3456661105155945},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1359502077102661}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1109/ccc.2009.21","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2009.21","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 24th Annual IEEE Conference on Computational Complexity","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.156.1731","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.1731","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~ryanw/circuit.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.156.3018","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.3018","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uchicago.edu/~fortnow/papers/linearcircuit.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.230.713","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.230.713","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepages.inf.ed.ac.uk/rsanthan/Papers/CollapseCktCCC.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.430.1762","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.430.1762","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/report/2006/157/download/","raw_type":"text"},{"id":"mag:2000159558","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc13.html#FortnowS06","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":44,"referenced_works":["https://openalex.org/W228759579","https://openalex.org/W269846650","https://openalex.org/W1518916050","https://openalex.org/W1596720500","https://openalex.org/W1973023438","https://openalex.org/W1983867193","https://openalex.org/W1984477611","https://openalex.org/W1989903304","https://openalex.org/W1989978772","https://openalex.org/W1996834809","https://openalex.org/W1998918799","https://openalex.org/W2026036943","https://openalex.org/W2043323794","https://openalex.org/W2057512592","https://openalex.org/W2082647621","https://openalex.org/W2083039580","https://openalex.org/W2089546742","https://openalex.org/W2092018479","https://openalex.org/W2092429268","https://openalex.org/W2095233625","https://openalex.org/W2096390054","https://openalex.org/W2097206148","https://openalex.org/W2117427692","https://openalex.org/W2123776260","https://openalex.org/W2130515620","https://openalex.org/W2132265944","https://openalex.org/W2134839489","https://openalex.org/W2137407595","https://openalex.org/W2140797111","https://openalex.org/W2144345645","https://openalex.org/W2148957455","https://openalex.org/W2151536080","https://openalex.org/W2151586869","https://openalex.org/W2158747250","https://openalex.org/W2164284862","https://openalex.org/W2293988196","https://openalex.org/W2296506534","https://openalex.org/W2331432079","https://openalex.org/W2912080987","https://openalex.org/W2998808137","https://openalex.org/W3150645827","https://openalex.org/W4212783949","https://openalex.org/W4213189504","https://openalex.org/W4256317935"],"related_works":["https://openalex.org/W2015611382","https://openalex.org/W2101944494","https://openalex.org/W2061236983","https://openalex.org/W2331148450","https://openalex.org/W2095428245","https://openalex.org/W1535131635","https://openalex.org/W2245029098","https://openalex.org/W2051347065","https://openalex.org/W2210325730","https://openalex.org/W3103019960","https://openalex.org/W2593893906","https://openalex.org/W1499171371","https://openalex.org/W2623107744","https://openalex.org/W2054479465","https://openalex.org/W2729985538","https://openalex.org/W1995540792","https://openalex.org/W2952155225","https://openalex.org/W1761037128","https://openalex.org/W2249214485","https://openalex.org/W2742329541"],"abstract_inverted_index":{"...":[0],"does":[1,32,188],"not":[2,33,189],"have":[3,34,55,190],"n":[4,202],"k-sized":[5],"circuits":[6,194],"for":[7,96,109,118,135,195,207,223],"any":[8,196],"k.":[9],"Do":[10],"smaller":[11],"classes":[12,151],"also":[13],"admit":[14],"such":[15,179],"circuit":[16,67,94,204],"lower":[17,68,205],"bounds?":[18],"Despite":[19],"several":[20,78],"improvements":[21],"of":[22,39,126,149],"Kannan\u2019s":[23],"result,":[24],"we":[25,244],"still":[26],"cannot":[27,200],"prove":[28],"that":[29,52,180,217,231],"P":[30,103,186,232,251],"NP":[31,86,131,187],"linear":[35],"size":[36,66,193],"circuits.":[37],"Work":[38],"Aaronson":[40],"and":[41,71,153,164,243,255],"Wigderson":[42],"provides":[43],"strong":[44],"evidence":[45],"\u2013":[46,51,85,99,112],"the":[47,73,124,142,215,228],"\u201calgebrization":[48],"\u201d":[49,137],"barrier":[50],"current":[53],"techniques":[54],"inherent":[56],"limitations":[57],"in":[58,88,107,115,160,171],"this":[59],"respect.":[60],"We":[61,76],"explore":[62],"questions":[63],"about":[64],"fixed-polynomial":[65],"bounds":[69,206],"around":[70],"beyond":[72],"algebrization":[74],"barrier.":[75],"find":[77],"connections,":[79],"including":[80],"The":[81],"following":[82],"are":[83],"equivalent:":[84],"is":[87,106,114,123,159,170,176],"SIZE(n":[89,116,161,172,221,241,258],"k)":[90,117,162,192,222],"(has":[91],"O(n":[92,191],"k)-size":[93],"families)":[95],"some":[97,110,119],"k":[98,105,111,155,225],"For":[100,145],"each":[101],"c,":[102],"NP[nc]":[104],"SIZE(n)":[108],"ONP/1":[113],"k,":[120],"where":[121],"ONP":[122],"class":[125],"languages":[127],"accepted":[128],"obliviously":[129],"by":[130],"machines,":[132],"with":[133],"witnesses":[134],"\u201cyes":[136],"instances":[138],"depending":[139],"only":[140,165],"on":[141,227],"input":[143],"length.":[144],"a":[146,177],"large":[147],"number":[148],"natural":[150],"C":[152,158],"all":[154,224],"\ufffd":[156],"1,":[157],"if":[163,166],"C/1":[167],"\u2229":[168],"P/poly":[169],"k).":[173],"If":[174],"there":[175],"d":[178],"MATIME(n)":[181],"\u2286":[182,220,234,240,253,257],"NTIME(n":[183],"d),":[184],"then":[185],"k>":[197],"0.":[198],"One":[199],"show":[201],"2-size":[203],"\u2295P":[208,252,256],"without":[209],"new":[210],"nonrelativizing":[211],"techniques.":[212],"In":[213],"particular,":[214],"proof":[216],"PP":[218,233,238],"\u0338":[219,239],"relies":[226],"(relativizing)":[229],"result":[230],"MA":[235,254],"=":[236],"\u21d2":[237],"k),":[242],"give":[245],"an":[246],"oracle":[247],"relative":[248],"to":[249],"which":[250],"2)":[259],"both":[260],"hold.":[261]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}