{"id":"https://openalex.org/W247221977","doi":"https://doi.org/10.1145/780591.780595","title":"Derandomizing polynomial identity tests means proving circuit lower bounds","display_name":"Derandomizing polynomial identity tests means proving circuit lower bounds","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W247221977","doi":"https://doi.org/10.1145/780591.780595","mag":"247221977"},"language":"en","primary_location":{"id":"doi:10.1145/780591.780595","doi":"https://doi.org/10.1145/780591.780595","is_oa":false,"landing_page_url":"https://doi.org/10.1145/780591.780595","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","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/A5066747130","display_name":"Valentine Kabanets","orcid":"https://orcid.org/0009-0002-2861-017X","observed_orcids":["https://orcid.org/0009-0002-2861-017X"]},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]},{"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":["CA","US"],"is_corresponding":false,"raw_author_name":"Valentine Kabanets","raw_affiliation_strings":["University of California, San Diego, La Jolla, CA","School of Computing Science, Simon Farser University, Vancover, BC V5A 1S6,Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, San Diego, La Jolla, CA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"School of Computing Science, Simon Farser University, Vancover, BC V5A 1S6,Canada#TAB#","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002208831","display_name":"Russell Impagliazzo","orcid":"https://orcid.org/0000-0003-3236-9796","observed_orcids":["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":["University of California, San Diego, La Jolla, CA","Department of Computer Science, University of California, San Diego, La Jolla, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, San Diego, La Jolla, CA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"Department of Computer Science, University of California, San Diego, La Jolla, CA","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9635,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.71398983,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9937000274658203,"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.9937000274658203,"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.0013000000035390258,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.0008999999845400453,"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-identity-testing","display_name":"polynomial identity testing","score":0.9110000133514404},{"id":"https://openalex.org/keywords/derandomization","display_name":"derandomization","score":0.9919999837875366},{"id":"https://openalex.org/keywords/circuit-lower-bounds","display_name":"circuit lower bounds","score":0.9480000138282776},{"id":"https://openalex.org/keywords/nexp","display_name":"NEXP","score":0.9330000281333923},{"id":"https://openalex.org/keywords/permanent","display_name":"permanent","score":0.7580000162124634},{"id":"https://openalex.org/keywords/arithmetic-circuits","display_name":"arithmetic circuits","score":0.9319999814033508},{"id":"https://openalex.org/keywords/arithmetic-formulas","display_name":"arithmetic formulas","score":0.7839999794960022},{"id":"https://openalex.org/keywords/rp","display_name":"RP","score":0.3050000071525574},{"id":"https://openalex.org/keywords/corps","display_name":"corps","score":0.8510000109672546},{"id":"https://openalex.org/keywords/bpp","display_name":"BPP","score":0.8560000061988831},{"id":"https://openalex.org/keywords/rnc","display_name":"RNC","score":0.9200000166893005},{"id":"https://openalex.org/keywords/superpolynomial-lower-bounds","display_name":"superpolynomial lower bounds","score":0.7279999852180481}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.804745078086853},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7050694227218628},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.6530461311340332},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5773959755897522},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.49955105781555176},{"id":"https://openalex.org/C155920423","wikidata":"https://www.wikidata.org/wiki/Q4791120","display_name":"Arithmetic circuit complexity","level":3,"score":0.48678848147392273},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4819042980670929},{"id":"https://openalex.org/C2778355321","wikidata":"https://www.wikidata.org/wiki/Q17079427","display_name":"Identity (music)","level":2,"score":0.41945332288742065},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.4122246503829956},{"id":"https://openalex.org/C83581934","wikidata":"https://www.wikidata.org/wiki/Q527381","display_name":"Arbitrary-precision arithmetic","level":2,"score":0.0954541265964508},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/780591.780595","doi":"https://doi.org/10.1145/780591.780595","is_oa":false,"landing_page_url":"https://doi.org/10.1145/780591.780595","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4398244834","https://openalex.org/W2078971842","https://openalex.org/W1577151476","https://openalex.org/W2181927644","https://openalex.org/W2389973593","https://openalex.org/W1977231030","https://openalex.org/W2041674703","https://openalex.org/W2587234873","https://openalex.org/W1978034012","https://openalex.org/W1988938797"],"abstract_inverted_index":{"We":[0,64,141],"show":[1,143],"that":[2,21,126,144],"derandomizing":[3],"Polynomial":[4,93],"Identity":[5,94],"Testing":[6,95],"is,":[7],"essentially,":[8],"equivalent":[9],"to":[10],"proving":[11,132],"circuit":[12,40,152],"lower":[13,134,153],"bounds":[14,135,154],"for":[15,136,155],"NEXP.":[16,159],"More":[17],"precisely,":[18],"we":[19,100],"prove":[20,66],"if":[22],"one":[23,77],"can":[24,78],"test":[25,79],"in":[26,80,158],"polynomial":[27],"time":[28,82],"(or,":[29,107],"even,":[30,108],"nondeterministic":[31],"subexponential":[32,81],"time,":[33],"infinitely":[34,113],"often)":[35],"whether":[36,83],"a":[37,67,84,97,156],"given":[38,85],"arithmetic":[39,62,74,86,122,139],"over":[41],"integers":[42],"computes":[43,88],"an":[44,89],"identically":[45,90],"zero":[46,91],"polynomial,":[47],"then":[48,76,115],"either":[49],"(i)":[50],"NEXP":[51,116],"\u2284":[52],"P/poly":[53],"or":[54,128,138],"(ii)":[55],"Permanent":[56,71],"is":[57,96,117],"not":[58,118],"computable":[59,119],"by":[60,120],"polynomial-size":[61,121],"circuits.":[63,123,140],"also":[65,142],"(partial)":[68],"converse:":[69],"If":[70,105],"requires":[72],"superpolynomial-size":[73],"circuits,":[75],"formula":[87],"polynomial.Since":[92],"coRP":[98],"problem,":[99],"obtain":[101],"the":[102],"following":[103],"corollary:":[104],"RP=P":[106],"coRP\u2286":[109],"\u2229\u03b5":[110],">":[111],"0NTIME(2(n\u03b5)),":[112],"often),":[114],"Thus,":[124],"establishing":[125],"RP=coRP":[127],"BPP=P":[129],"would":[130,149],"require":[131],"superpolynomial":[133],"Boolean":[137],"any":[145],"derandomization":[146],"of":[147],"RNC":[148],"yield":[150],"new":[151],"language":[157]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-09-21T07:43:02.447757","created_date":"2025-10-10T00:00:00"}