{"id":"https://openalex.org/W3143673400","doi":"https://doi.org/10.1109/iccad.2008.4681549","title":"Boolean factoring and decomposition of logic networks","display_name":"Boolean factoring and decomposition of logic networks","publication_year":2008,"publication_date":"2008-11-01","ids":{"openalex":"https://openalex.org/W3143673400","doi":"https://doi.org/10.1109/iccad.2008.4681549","mag":"3143673400"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2008.4681549","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2008.4681549","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE/ACM International Conference on Computer-Aided Design","raw_type":"proceedings-article"},"type":"conference-paper","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/A5110450560","display_name":"Alan Mishchenko","orcid":"https://orcid.org/0009-0004-1303-6261"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan Mishchenko","raw_affiliation_strings":["Department of EECS, University of California, Berkeley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of EECS, University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064568178","display_name":"Robert K. Brayton","orcid":"https://orcid.org/0000-0002-3861-1718"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Brayton","raw_affiliation_strings":["Department of EECS, University of California, Berkeley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of EECS, University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102897547","display_name":"Satrajit Chatterjee","orcid":"https://orcid.org/0000-0001-8135-8378"},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Satrajit Chatterjee","raw_affiliation_strings":["Intel Corporation, Hillsboro, OR, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Intel Corporation, Hillsboro, OR, USA","institution_ids":["https://openalex.org/I1343180700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"38","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9828000068664551,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6626257300376892},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.607711136341095},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5908102989196777},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5890195369720459},{"id":"https://openalex.org/keywords/lookup-table","display_name":"Lookup table","score":0.5806446671485901},{"id":"https://openalex.org/keywords/factoring","display_name":"Factoring","score":0.5749432444572449},{"id":"https://openalex.org/keywords/truth-table","display_name":"Truth table","score":0.5622389316558838},{"id":"https://openalex.org/keywords/logic-synthesis","display_name":"Logic synthesis","score":0.5467695593833923},{"id":"https://openalex.org/keywords/logic-optimization","display_name":"Logic optimization","score":0.5453587770462036},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.5333001613616943},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.48675060272216797},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48026275634765625},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.45443102717399597},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43434134125709534},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2825131416320801},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.21367570757865906},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08121523261070251}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6626257300376892},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.607711136341095},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5908102989196777},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5890195369720459},{"id":"https://openalex.org/C134835016","wikidata":"https://www.wikidata.org/wiki/Q690265","display_name":"Lookup table","level":2,"score":0.5806446671485901},{"id":"https://openalex.org/C177225278","wikidata":"https://www.wikidata.org/wiki/Q192674","display_name":"Factoring","level":2,"score":0.5749432444572449},{"id":"https://openalex.org/C56949724","wikidata":"https://www.wikidata.org/wiki/Q219079","display_name":"Truth table","level":2,"score":0.5622389316558838},{"id":"https://openalex.org/C157922185","wikidata":"https://www.wikidata.org/wiki/Q173198","display_name":"Logic synthesis","level":3,"score":0.5467695593833923},{"id":"https://openalex.org/C28449271","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Logic optimization","level":4,"score":0.5453587770462036},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5333001613616943},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.48675060272216797},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48026275634765625},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.45443102717399597},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43434134125709534},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2825131416320801},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21367570757865906},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08121523261070251},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad.2008.4681549","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2008.4681549","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE/ACM International Conference on Computer-Aided Design","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W98076553","https://openalex.org/W191551858","https://openalex.org/W1519337070","https://openalex.org/W1905608265","https://openalex.org/W1985457698","https://openalex.org/W2015415966","https://openalex.org/W2025617772","https://openalex.org/W2056693747","https://openalex.org/W2093176534","https://openalex.org/W2099134576","https://openalex.org/W2100955320","https://openalex.org/W2114556285","https://openalex.org/W2129147175","https://openalex.org/W2133743520","https://openalex.org/W2134060873","https://openalex.org/W2140727935","https://openalex.org/W2150787480","https://openalex.org/W2156753779","https://openalex.org/W2159352256","https://openalex.org/W2323419649","https://openalex.org/W3143290261","https://openalex.org/W3148005990","https://openalex.org/W3149600067","https://openalex.org/W3151473321","https://openalex.org/W4237666325","https://openalex.org/W4240866746","https://openalex.org/W4247200807","https://openalex.org/W4247856820","https://openalex.org/W4252129833","https://openalex.org/W4255864279","https://openalex.org/W4256548512","https://openalex.org/W6603989001","https://openalex.org/W6607838976","https://openalex.org/W6659565235","https://openalex.org/W6675636599","https://openalex.org/W6676950945","https://openalex.org/W6682914323","https://openalex.org/W6683604362","https://openalex.org/W6683622678","https://openalex.org/W6697174721"],"related_works":["https://openalex.org/W1159523076","https://openalex.org/W2053477566","https://openalex.org/W2522397711","https://openalex.org/W1604327230","https://openalex.org/W3020862667","https://openalex.org/W1993197222","https://openalex.org/W1539416635","https://openalex.org/W2891804744","https://openalex.org/W2130665499","https://openalex.org/W1565986912"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"new":[3,38],"methods":[4,75],"for":[5,16,40,86],"restructuring":[6],"logic":[7,25],"networks":[8,96],"based":[9],"on":[10,94],"fast":[11,64],"Boolean":[12,74],"techniques.":[13],"The":[14],"basis":[15],"these":[17,42,46],"are":[18],"1)":[19],"a":[20,24,37],"cut-based":[21],"view":[22],"of":[23,33,80,102,115],"network,":[26],"2)":[27],"exploiting":[28],"the":[29,77,116],"uniqueness":[30],"and":[31,50,89],"speed":[32,88],"disjoint-support":[34],"decompositions,":[35,49],"3)":[36],"heuristic":[39],"speeding":[41],"up,":[43],"4)":[44],"extending":[45],"to":[47,55,111],"general":[48],"5)":[51],"limiting":[52],"local":[53],"transformations":[54],"functions":[56],"with":[57],"16":[58],"or":[59],"less":[60],"inputs":[61],"so":[62],"that":[63],"truth":[65],"table":[66],"manipulations":[67],"can":[68],"be":[69],"used":[70],"in":[71,104],"all":[72],"operations.":[73],"lessen":[76],"structural":[78],"bias":[79],"algebraic":[81],"methods,":[82],"while":[83,107],"still":[84],"allowing":[85],"high":[87],"multiple":[90],"iterations.":[91],"Experimental":[92],"results":[93],"K-LUT":[95],"show":[97],"an":[98],"average":[99],"additional":[100],"reduction":[101],"5.4%":[103],"LUT":[105],"count,":[106],"preserving":[108],"delay,":[109],"compared":[110],"heavily":[112],"optimized":[113],"versions":[114],"same":[117],"networks.":[118]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}