{"id":"https://openalex.org/W2281885423","doi":"https://doi.org/10.4230/lipics.fsttcs.2012.36","title":"Certifying polynomials for AC^0(parity) circuits, with applications","display_name":"Certifying polynomials for AC^0(parity) circuits, with applications","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2281885423","doi":"https://doi.org/10.4230/lipics.fsttcs.2012.36","mag":"2281885423"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:3846","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2012.36","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.4230/lipics.fsttcs.2012.36","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031695135","display_name":"Swastik Kopparty","orcid":"https://orcid.org/0000-0003-2704-8808"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kopparty, Swastik","raw_affiliation_strings":["School of Arts and Sciences, Mathematics"],"affiliations":[{"raw_affiliation_string":"School of Arts and Sciences, Mathematics","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025305994","display_name":"Srikanth Srinivasan","orcid":"https://orcid.org/0000-0001-6491-124X"},"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":false,"raw_author_name":"Srinivasan, Srikanth","raw_affiliation_strings":["Rutgers - The State University of New Jersey, New Brunswick"],"affiliations":[{"raw_affiliation_string":"Rutgers - The State University of New Jersey, New Brunswick","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031695135"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7277,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.85731989,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"18","issue":null,"first_page":"36","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9986000061035156,"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.9941999912261963,"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/parity","display_name":"Parity (physics)","score":0.7395644187927246},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.6103305220603943},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6041699647903442},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5480523109436035},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5088717937469482},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4790964424610138},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.46030405163764954},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.20153358578681946},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1405804455280304},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.10589155554771423}],"concepts":[{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.7395644187927246},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.6103305220603943},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6041699647903442},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5480523109436035},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5088717937469482},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4790964424610138},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.46030405163764954},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.20153358578681946},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1405804455280304},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.10589155554771423}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:3846","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2012.36","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.fsttcs.2012.36","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fsttcs.2012.36","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""},{"id":"mag:2281885423","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2012.html#KoppartyS12","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.4230/lipics.fsttcs.2012.36","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fsttcs.2012.36","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":""},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W10078005","https://openalex.org/W50958263","https://openalex.org/W66508742","https://openalex.org/W1984108045","https://openalex.org/W1988762827","https://openalex.org/W1997768152","https://openalex.org/W1998480106","https://openalex.org/W2017290750","https://openalex.org/W2060270693","https://openalex.org/W2070678975","https://openalex.org/W2110128015","https://openalex.org/W2142610181","https://openalex.org/W2173078028","https://openalex.org/W2611287588","https://openalex.org/W2912080987"],"related_works":["https://openalex.org/W2070678975","https://openalex.org/W2165293955","https://openalex.org/W2042194938","https://openalex.org/W1984108045","https://openalex.org/W2091937735","https://openalex.org/W2982420825","https://openalex.org/W2937819376","https://openalex.org/W3168912476","https://openalex.org/W1883887292","https://openalex.org/W2952133313","https://openalex.org/W3058516402","https://openalex.org/W3083750962","https://openalex.org/W2894446132","https://openalex.org/W2950299193","https://openalex.org/W3094151347","https://openalex.org/W1706616850","https://openalex.org/W3011649984","https://openalex.org/W1524668069","https://openalex.org/W2258363612","https://openalex.org/W2949394968"],"abstract_inverted_index":{"In":[0,156],"this":[1,20],"paper,":[2],"we":[3,112,159],"introduce":[4],"and":[5,51,73,92],"develop":[6],"the":[7,43,86,109,134,151,157,174],"method":[8,21],"of":[9,33,45,48,58,70,77,90,105,120,136,150,153,166,176,182],"certifying":[10,83,154],"polynomials":[11,84,178],"for":[12,115,179],"proving":[13],"AC^0":[14,103],"circuit":[15,118],"lower":[16,164],"bounds.":[17],"We":[18,142],"use":[19],"to":[22,138],"show":[23,113,160],"that":[24,96,114,133],"Approximate":[25,97],"Majority":[26,98],"cannot":[27,99],"be":[28,100],"computed":[29,101],"by":[30,102],"AC^0(parity)":[31,46,53,68,75,180],"circuits":[32,47,57,69,76,104,181],"size":[34,50,72,106,183],"n^{1":[35],"+":[36],"o(1)}.":[37],"This":[38,61],"implies":[39,63],"a":[40,64,125],"separation":[41,65],"between":[42,66],"power":[44,152],"near-linear":[49,78,121],"uniform":[52],"(and":[54],"even":[55],"AC^0)":[56],"polynomial":[59],"size.":[60,79],"also":[62,143],"randomized":[67],"linear":[71],"deterministic":[74,87],"Our":[80],"proof":[81],"using":[82],"extends":[85],"restrictions":[88],"technique":[89],"Chaudhuri":[91],"Radhakrishnan,":[93],"who":[94],"showed":[95],"n^{1+o(1)}.":[107],"At":[108],"technical":[110],"level,":[111],"every":[116],"ACP":[117],"C":[119,137],"size,":[122],"there":[123],"is":[124,140],"low":[126],"degree":[127,175],"variety":[128],"V":[129,139],"over":[130],"F_2":[131],"such":[132],"restriction":[135],"constant.":[141],"prove":[144],"other":[145],"results":[146],"exploring":[147],"various":[148],"aspects":[149],"polynomials.":[155],"process,":[158],"an":[161],"essentially":[162],"optimal":[163],"bound":[165],"Omega\\left(\\log^{\\Theta(d)}":[167],"s":[168],"\\cdot":[169],"\\log":[170],"\\frac{1}{\\epsilon}":[171],"\\right)":[172],"on":[173],"\\epsilon-approximating":[177],"s.":[184]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}