{"id":"https://openalex.org/W2056994701","doi":"https://doi.org/10.1137/060664537","title":"Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table","display_name":"Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2056994701","doi":"https://doi.org/10.1137/060664537","mag":"2056994701"},"language":"en","primary_location":{"id":"doi:10.1137/060664537","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060664537","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/A5078734824","display_name":"Eric Allender","orcid":"https://orcid.org/0000-0002-0650-028X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Eric Allender","raw_affiliation_strings":["allender@cs.rutgers.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"allender@cs.rutgers.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039703362","display_name":"Lisa Hellerstein","orcid":"https://orcid.org/0000-0002-3743-7965"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lisa Hellerstein","raw_affiliation_strings":["hstein@cis.poly.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"hstein@cis.poly.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085497932","display_name":"Paul McCabe","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Paul McCabe","raw_affiliation_strings":["pmccabe@cs.toronto.edu and toni@cs.toronto.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"pmccabe@cs.toronto.edu and toni@cs.toronto.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003318200","display_name":"Toniann Pitassi","orcid":"https://orcid.org/0000-0002-8668-2174"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Toniann Pitassi","raw_affiliation_strings":["University of Toronto"],"affiliations":[{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030610930","display_name":"Michael Saks","orcid":"https://orcid.org/0000-0003-1659-7190"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Saks","raw_affiliation_strings":["saks@math.rutgers.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"saks@math.rutgers.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5078734824"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0026,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.86587418,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"38","issue":"1","first_page":"63","last_page":"84"},"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.9976999759674072,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.996399998664856,"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/boolean-function","display_name":"Boolean function","score":0.7398226261138916},{"id":"https://openalex.org/keywords/truth-table","display_name":"Truth table","score":0.702736496925354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6383785605430603},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5992318391799927},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.5843585133552551},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.528824508190155},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.5257766246795654},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5232309699058533},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5199971795082092},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.466068297624588},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4503900706768036},{"id":"https://openalex.org/keywords/circuit-minimization-for-boolean-functions","display_name":"Circuit minimization for Boolean functions","score":0.4289763569831848},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.4219765365123749},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4194556772708893},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.4159139394760132},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.41522207856178284},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23974266648292542}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.7398226261138916},{"id":"https://openalex.org/C56949724","wikidata":"https://www.wikidata.org/wiki/Q219079","display_name":"Truth table","level":2,"score":0.702736496925354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6383785605430603},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5992318391799927},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5843585133552551},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.528824508190155},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.5257766246795654},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5232309699058533},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5199971795082092},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.466068297624588},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4503900706768036},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.4289763569831848},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.4219765365123749},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4194556772708893},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.4159139394760132},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.41522207856178284},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23974266648292542},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"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/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/060664537","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060664537","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"},{"id":"pmh:oai:alma.01RUT_INST:11663607520004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/journalArticle/Minimizing-disjunctive-normal-form-formulas-and/991031654762004646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1970259241","https://openalex.org/W2008771827","https://openalex.org/W2019184769","https://openalex.org/W2040924621","https://openalex.org/W2050166670","https://openalex.org/W2052679199","https://openalex.org/W2059453880","https://openalex.org/W2069652878","https://openalex.org/W2072682576","https://openalex.org/W2082448265","https://openalex.org/W2088188524","https://openalex.org/W2115404728","https://openalex.org/W2117049614","https://openalex.org/W2124218043","https://openalex.org/W2126479983","https://openalex.org/W2130402533","https://openalex.org/W2143996311","https://openalex.org/W2157054705","https://openalex.org/W2163322487","https://openalex.org/W2912080987","https://openalex.org/W4230261825"],"related_works":["https://openalex.org/W3204916073","https://openalex.org/W2522397711","https://openalex.org/W1487679090","https://openalex.org/W1918236823","https://openalex.org/W2011469629","https://openalex.org/W2055594799","https://openalex.org/W1597080238","https://openalex.org/W2952185983","https://openalex.org/W2487593933","https://openalex.org/W1604327230"],"abstract_inverted_index":{"For":[0],"circuit":[1,55,205],"classes":[2,211],"R,":[3],"the":[4,11,53,91,115,184,188,201,238],"fundamental":[5],"computational":[6],"problem":[7,27,57],"Min-R":[8],"asks":[9,31,60],"for":[10,130,147,207],"minimum":[12,54],"R-size":[13],"of":[14,25,94,160,170,180,203,212,219,240],"a":[15,20,33,39,43,62,67,71,78,110,124,168],"Boolean":[16,35,63,74],"function":[17,36,64],"presented":[18,37,65],"as":[19,38,66],"truth":[21,40,68],"table.":[22],"Prominent":[23],"examples":[24],"this":[26],"include":[28],"Min-DNF,":[29],"which":[30,59,103,183],"whether":[32,61,161],"given":[34],"table":[41,69],"has":[42,70],"k-term":[44],"disjunctive":[45],"normal":[46],"form":[47],"(DNF),":[48],"and":[49,221],"Min-Circuit":[50],"(also":[51],"called":[52],"size":[56,72,206,239],"(MCSP)),":[58],"k":[73],"circuit.":[75],"We":[76,107,230],"present":[77],"new":[79],"reduction":[80,93],"proving":[81],"that":[82,117,135,232],"Min-DNF":[83,118,162,181],"is":[84,87,104,137,150,191,234],"NP-complete.":[85],"It":[86],"significantly":[88],"simpler":[89],"than":[90,127,195],"known":[92],"Masek":[95],"[Some":[96],"NP-Complete":[97],"Set":[98,148],"Covering":[99],"Problems,":[100],"manuscript,":[101],"1979],":[102],"from":[105],"Circuit-SAT.":[106],"then":[108],"give":[109],"more":[111,209],"complex":[112],"reduction,":[113],"yielding":[114],"result":[116],"cannot":[119],"be":[120,164],"approximated":[121,165],"to":[122,155,166,200,236],"within":[123,167],"factor":[125,169],"smaller":[126],"$(\\log":[128],"N)^{\\gamma}$,":[129],"some":[131],"constant":[132],"$\\gamma>0$,":[133],"assuming":[134],"NP":[136],"not":[138],"contained":[139],"in":[140,153],"quasi-polynomial":[141],"time.":[142],"The":[143,158],"standard":[144],"greedy":[145,189],"algorithm":[146,190],"Cover":[149],"often":[151],"used":[152],"practice":[154],"approximate":[156,237],"Min-DNF.":[157],"question":[159,202],"can":[163],"$o(\\log":[171],"N)$":[172,193],"remains":[173],"open,":[174],"but":[175],"we":[176,198],"construct":[177],"an":[178],"instance":[179],"on":[182],"solution":[185],"produced":[186],"by":[187,228],"$\\Omega(\\log":[192],"larger":[194],"optimal.":[196],"Finally,":[197],"turn":[199],"approximating":[204],"slightly":[208],"general":[210],"circuits.":[213],"DNF":[214],"formulas":[215],"are":[216,226],"depth-two":[217],"circuits":[218,225,242],"AND":[220],"OR":[222],"gates.":[223],"Depth-d":[224],"denoted":[227],"$AC^0_d$.":[229],"show":[231],"it":[233],"hard":[235],"$AC^0_d$":[241],"(for":[243],"large":[244],"enough":[245],"d)":[246],"under":[247],"cryptographic":[248],"assumptions.":[249]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}