{"id":"https://openalex.org/W1954751530","doi":"https://doi.org/10.1137/14097402x","title":"Approximating Boolean Functions with Depth-2 Circuits","display_name":"Approximating Boolean Functions with Depth-2 Circuits","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1954751530","doi":"https://doi.org/10.1137/14097402x","mag":"1954751530"},"language":"en","primary_location":{"id":"doi:10.1137/14097402x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14097402x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5000042413","display_name":"Eric Blais","orcid":"https://orcid.org/0009-0000-5824-9034"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Eric Blais","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5029451171","display_name":"Li-Yang Tan","orcid":"https://orcid.org/0000-0002-1279-4384"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li-Yang Tan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000042413"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.05644524,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"44","issue":"6","first_page":"1583","last_page":"1600"},"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.9998000264167786,"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.9998000264167786,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9998000264167786,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9980999827384949,"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/mathematics","display_name":"Mathematics","score":0.8261044025421143},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.7928586006164551},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6710385084152222},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.631673276424408},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5795549154281616},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5307400822639465},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5198096036911011},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.5114673376083374},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.42373839020729065},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4196835160255432},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.41388726234436035},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.26301318407058716},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.16412031650543213},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09565722942352295},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08289861679077148}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8261044025421143},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.7928586006164551},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6710385084152222},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.631673276424408},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5795549154281616},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5307400822639465},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5198096036911011},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.5114673376083374},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.42373839020729065},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4196835160255432},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.41388726234436035},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.26301318407058716},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.16412031650543213},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09565722942352295},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08289861679077148},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/14097402x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14097402x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2036656440","https://openalex.org/W2060270693","https://openalex.org/W2088559598","https://openalex.org/W2107482120","https://openalex.org/W2110503949","https://openalex.org/W2139991023","https://openalex.org/W2278710187","https://openalex.org/W2568004999","https://openalex.org/W2575739199","https://openalex.org/W4206696315","https://openalex.org/W4300757861"],"related_works":["https://openalex.org/W3204916073","https://openalex.org/W2952185983","https://openalex.org/W2009341260","https://openalex.org/W2055594799","https://openalex.org/W2340850974","https://openalex.org/W2403507963","https://openalex.org/W2056017973","https://openalex.org/W2486254595","https://openalex.org/W1493450096","https://openalex.org/W3006210518"],"abstract_inverted_index":{"We":[0,120],"study":[1],"the":[2,24,31,34,38,46,109,123,130,138,146,154,187,194,200],"complexity":[3],"of":[4,26,33,66,81,111,125,133,148,166,189,199,202,206],"approximating":[5],"Boolean":[6,28,58,73],"functions":[7],"with":[8],"disjunctive":[9],"normal":[10],"forms":[11],"(DNFs)":[12],"and":[13,30,70,117,169,204],"other":[14],"depth-2":[15,103],"circuits,":[16],"exploring":[17],"two":[18],"main":[19,42,142],"directions:":[20],"universal":[21,49,96],"bounds":[22,51,98],"on":[23,52,99],"approximability":[25,32,53,100],"all":[27],"functions,":[29,116],"parity":[35,156],"function.":[36,136],"In":[37,137],"first":[39,47],"direction,":[40],"our":[41,126,141,179],"positive":[43,143],"results":[44],"are":[45],"nontrivial":[48],"upper":[50,97],"by":[54,63,78,101,163],"DNFs:":[55],"(a)":[56],"every":[57,72],"function":[59,74],"can":[60,75,160],"be":[61,76,161],"$\\epsilon$-approximated":[62,77,162],"a":[64,79,134,164],"DNF":[65,80,151,165],"size":[67,167],"$O_\\epsilon(2^n/\\log":[68],"n)$,":[69],"(b)":[71],"width":[82,170],"$c_\\epsilon\\,":[83],"n$,":[84],"where":[85],"$c_\\epsilon":[86],"<":[87],"1$.":[88],"Our":[89],"techniques":[90],"extend":[91],"broadly":[92],"to":[93],"give":[94],"strong":[95],"various":[102],"circuits":[104],"that":[105,122,152,178],"generalize":[106],"DNFs,":[107],"including":[108],"intersection":[110,201,205],"halfspaces,":[112],"low-degree":[113],"Polynomial":[114],"threshold":[115],"unate":[118,207],"functions.":[119,208],"show":[121,177],"parameters":[124],"constructions":[127],"almost":[128],"match":[129],"information-theoretic":[131],"inapproximability":[132],"random":[135],"second":[139],"direction":[140],"result":[144],"is":[145,181],"construction":[147,180],"an":[149],"explicit":[150],"approximates":[153],"following":[155],"function:":[157],"${\\sf":[158],"PAR}_n$":[159],"$2^{(1-2\\epsilon)n}$":[168],"$(1-2\\epsilon)n$.":[171],"Using":[172],"Fourier":[173],"analytic":[174],"tools":[175],"we":[176],"essentially":[182],"optimal":[183],"not":[184],"just":[185],"within":[186,193],"class":[188],"DNFs":[190],"but":[191],"also":[192],"far":[195],"more":[196],"expressive":[197],"classes":[198],"halfspaces":[203]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}