{"id":"https://openalex.org/W1969961332","doi":"https://doi.org/10.1142/s1793830910000851","title":"ON THE HARDNESS AGAINST CONSTANT-DEPTH LINEAR-SIZE CIRCUITS","display_name":"ON THE HARDNESS AGAINST CONSTANT-DEPTH LINEAR-SIZE CIRCUITS","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W1969961332","doi":"https://doi.org/10.1142/s1793830910000851","mag":"1969961332"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830910000851","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830910000851","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5102911765","display_name":"Chi-Jen Lu","orcid":"https://orcid.org/0000-0003-0835-1190"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]},{"id":"https://openalex.org/I4210098366","display_name":"Institute of Information Science, Academia Sinica","ror":"https://ror.org/00z83z196","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210098366","https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"CHI-JEN LU","raw_affiliation_strings":["Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan","Institute of Information Science, Academia Sinica, Taipei, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Institute of Information Science, Academia Sinica, Taipei, Taiwan","institution_ids":["https://openalex.org/I4210098366"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053176204","display_name":"Hsin-Lung Wu","orcid":"https://orcid.org/0000-0002-1129-3668"},"institutions":[{"id":"https://openalex.org/I99613584","display_name":"National Taipei University","ror":"https://ror.org/03e29r284","country_code":"TW","type":"education","lineage":["https://openalex.org/I99613584"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"HSIN-LUNG WU","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Taipei University, Taipei County 237, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Taipei University, Taipei County 237, Taiwan","institution_ids":["https://openalex.org/I99613584"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3383,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.59069873,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"02","issue":"04","first_page":"515","last_page":"526"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/constant","display_name":"Constant (computer programming)","score":0.6698070764541626},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6492587327957153},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.6050969362258911},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.5972285270690918},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5883970260620117},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5522361993789673},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.5409461259841919},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.521614670753479},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4938729405403137},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.4695746600627899},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3692353367805481},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3352656364440918},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33308151364326477},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32989710569381714},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2207624614238739},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.13414019346237183},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07232204079627991}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6698070764541626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6492587327957153},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.6050969362258911},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.5972285270690918},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5883970260620117},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5522361993789673},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.5409461259841919},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.521614670753479},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4938729405403137},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.4695746600627899},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3692353367805481},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3352656364440918},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33308151364326477},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32989710569381714},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2207624614238739},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.13414019346237183},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07232204079627991},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830910000851","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830910000851","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321040","display_name":"National Science Council","ror":"https://ror.org/02kv4zf79"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1901622511","https://openalex.org/W1998918799","https://openalex.org/W2064149002","https://openalex.org/W2998808137","https://openalex.org/W4212956348"],"related_works":["https://openalex.org/W2173966285","https://openalex.org/W1977590950","https://openalex.org/W3202331273","https://openalex.org/W4286972813","https://openalex.org/W2086025566","https://openalex.org/W1702487489","https://openalex.org/W2132910148","https://openalex.org/W1891695470","https://openalex.org/W2027501230","https://openalex.org/W2042051386"],"abstract_inverted_index":{"The":[0],"notion":[1],"of":[2,80,120,155],"average-case":[3,37],"hardness":[4,105,116],"is":[5,53,132],"a":[6,44,50,57],"fundamental":[7],"one":[8,47],"in":[9,19,60,66,123],"complexity":[10,58,99],"theory.":[11],"In":[12],"particular,":[13],"it":[14],"plays":[15],"an":[16],"important":[17],"role":[18],"the":[20,34,61,67,72,115,129,144],"research":[21],"on":[22,33,74,147],"derandomization,":[23,46],"as":[24],"there":[25],"are":[26,31,88,93],"general":[27],"derandomization":[28],"results":[29,87],"which":[30,52],"based":[32],"assumption":[35],"that":[36,63,128],"hard":[38,55,134],"functions":[39],"exist.":[40],"However,":[41],"to":[42,70,142],"achieve":[43],"complete":[45],"usually":[48],"needs":[49],"function":[51,73,131,146],"extremely":[54,133],"against":[56,117],"class,":[59],"sense":[62],"any":[64,137],"algorithm":[65],"class":[68],"fails":[69],"compute":[71,143],"1/2":[75,150],"-":[76,151],"2":[77,152],"-\u03a9(n)":[78,153],"fraction":[79,154],"its":[81],"n-bit":[82],"inputs.":[83,156],"Unfortunately,":[84],"lower":[85],"bound":[86],"very":[89,97],"rare":[90],"and":[91,101],"they":[92],"only":[94],"known":[95],"for":[96,135],"restricted":[98],"classes,":[100],"achieving":[102],"such":[103,138],"extreme":[104],"seems":[106],"even":[107],"more":[108],"difficult.":[109],"Motivated":[110],"by":[111],"this,":[112],"we":[113],"study":[114],"linear-size":[118],"circuits":[119],"constant":[121],"depth":[122],"this":[124],"paper.":[125],"We":[126],"show":[127],"parity":[130,145],"them:":[136],"circuit":[139],"must":[140],"fail":[141],"at":[148],"least":[149]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}