{"id":"https://openalex.org/W2147154704","doi":"https://doi.org/10.1109/sct.1993.336538","title":"The polynomial method in circuit complexity","display_name":"The polynomial method in circuit complexity","alternate_titles":[],"publication_year":2002,"publication_date":"2002-12-30","ids":{"openalex":"https://openalex.org/W2147154704","doi":"https://doi.org/10.1109/sct.1993.336538","mag":"2147154704"},"language":"en","primary_location":{"id":"doi:10.1109/sct.1993.336538","doi":"https://doi.org/10.1109/sct.1993.336538","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sct.1993.336538","pdf_url":null,"source":{"id":"https://openalex.org/S4210204929","display_name":"IEEE Conference on Computational Complexity (CCC)","issn_l":"1093-0159","issn":["1093-0159","2575-8403"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2147154704"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5078715930","display_name":"Richard Beigel","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]},{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R. Beigel","raw_affiliation_strings":["Department of Computer Science, Yale University, New Heaven, CT, USA","Maryland Univ., College Park, MD, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yale University, New Heaven, CT, USA","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"Maryland Univ., College Park, MD, USA#TAB#","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078715930"],"corresponding_institution_ids":["https://openalex.org/I32971472","https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":6.6119,"has_fulltext":false,"cited_by_count":183,"citation_normalized_percentile":{"value":0.97728638,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"82","last_page":"95"},"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.9901999831199646,"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.9901999831199646,"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.0035000001080334187,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/polynomial-method","display_name":"polynomial method","score":0.984000027179718},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"circuit complexity","score":0.953000009059906},{"id":"https://openalex.org/keywords/constant-depth-circuits","display_name":"constant-depth circuits","score":0.9800000190734863},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.6520000100135803},{"id":"https://openalex.org/keywords/upper-bounds","display_name":"upper bounds","score":0.8100000023841858},{"id":"https://openalex.org/keywords/closure-properties","display_name":"closure properties","score":0.984000027179718},{"id":"https://openalex.org/keywords/algebraic-complexity-theory","display_name":"algebraic complexity theory","score":0.5730000138282776}],"concepts":[{"id":"https://openalex.org/C2777159308","wikidata":"https://www.wikidata.org/wiki/Q1757948","display_name":"Formality","level":2,"score":0.6042422652244568},{"id":"https://openalex.org/C132010649","wikidata":"https://www.wikidata.org/wiki/Q189222","display_name":"Intuition","level":2,"score":0.5928942561149597},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5439181327819824},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.509159505367279},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4706681966781616},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4574945867061615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4446309506893158},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44262686371803284},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.43601152300834656},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4106256365776062},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.40490078926086426},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4029463231563568},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3791098892688751},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36073315143585205},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10854923725128174},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.07763171195983887},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sct.1993.336538","doi":"https://doi.org/10.1109/sct.1993.336538","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sct.1993.336538","pdf_url":null,"source":{"id":"https://openalex.org/S4210204929","display_name":"IEEE Conference on Computational Complexity (CCC)","issn_l":"1093-0159","issn":["1093-0159","2575-8403"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":64,"referenced_works":["https://openalex.org/W107724628","https://openalex.org/W162452278","https://openalex.org/W212479494","https://openalex.org/W1491883230","https://openalex.org/W1495935433","https://openalex.org/W1500453128","https://openalex.org/W1551833159","https://openalex.org/W1565875822","https://openalex.org/W1566753984","https://openalex.org/W1659104947","https://openalex.org/W1736584826","https://openalex.org/W1920818137","https://openalex.org/W1967283546","https://openalex.org/W1970614317","https://openalex.org/W1974411071","https://openalex.org/W1975790950","https://openalex.org/W1979124844","https://openalex.org/W1984108045","https://openalex.org/W1986804393","https://openalex.org/W1990538552","https://openalex.org/W1991009204","https://openalex.org/W1991410070","https://openalex.org/W2009849678","https://openalex.org/W2009994177","https://openalex.org/W2023834316","https://openalex.org/W2025070700","https://openalex.org/W2027328186","https://openalex.org/W2030728433","https://openalex.org/W2038230325","https://openalex.org/W2045924252","https://openalex.org/W2051378572","https://openalex.org/W2054996571","https://openalex.org/W2057512592","https://openalex.org/W2060270693","https://openalex.org/W2062767125","https://openalex.org/W2069124970","https://openalex.org/W2070678975","https://openalex.org/W2075848688","https://openalex.org/W2081131534","https://openalex.org/W2089914953","https://openalex.org/W2097113463","https://openalex.org/W2106180580","https://openalex.org/W2111824166","https://openalex.org/W2116794057","https://openalex.org/W2122659679","https://openalex.org/W2128094054","https://openalex.org/W2132750992","https://openalex.org/W2137438459","https://openalex.org/W2147476493","https://openalex.org/W2150157290","https://openalex.org/W2164668355","https://openalex.org/W2164880161","https://openalex.org/W2165293955","https://openalex.org/W2165676867","https://openalex.org/W2169974244","https://openalex.org/W2325700781","https://openalex.org/W2611287588","https://openalex.org/W2912133662","https://openalex.org/W4210720364","https://openalex.org/W4243280876","https://openalex.org/W4250632526","https://openalex.org/W4255981805","https://openalex.org/W6637264250","https://openalex.org/W6637501879"],"related_works":["https://openalex.org/W2242296381","https://openalex.org/W7098460194","https://openalex.org/W3099084347","https://openalex.org/W2513873863","https://openalex.org/W2030728433","https://openalex.org/W2401145583","https://openalex.org/W2171403864","https://openalex.org/W2401419345","https://openalex.org/W69786881","https://openalex.org/W2594458442"],"abstract_inverted_index":{"The":[0,18,34],"basic":[1],"techniques":[2],"for":[3],"using":[4],"polynomials":[5],"in":[6],"complexity":[7],"theory":[8],"are":[9,46],"examined,":[10],"emphasizing":[11],"intuition":[12],"at":[13,27],"the":[14,22,28],"expense":[15,29],"of":[16,30],"formality.":[17],"focus":[19],"is":[20],"on":[21],"connections":[23],"to":[24],"constant-depth":[25],"circuits,":[26],"polynomial-time":[31],"Turing":[32],"machines.":[33],"closure":[35],"properties,":[36],"upper":[37],"bounds,":[38],"and":[39],"lower":[40],"bounds":[41],"obtained":[42],"by":[43],"this":[44],"approach":[45],"surveyed.>":[47]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2147154704","counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":5}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
