{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:58:51Z","timestamp":1740131931992,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2019,9,1]]},"DOI":"10.1109\/tc.2019.2906201","type":"journal-article","created":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T20:25:58Z","timestamp":1553027158000},"page":"1269-1282","source":"Crossref","is-referenced-by-count":2,"title":["Boolean Minimization of Projected Sums of Products via Boolean Relations"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0263-5221","authenticated-orcid":false,"given":"Anna","family":"Bernasconi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0469-4201","authenticated-orcid":false,"given":"Valentina","family":"Ciriani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5904-0969","authenticated-orcid":false,"given":"Gabriella","family":"Trucco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9671-8804","authenticated-orcid":false,"given":"Tiziano","family":"Villa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"Logic synthesis and optimization benchmarks user guide version 3.0","year":"1991","author":"yang","key":"ref39"},{"key":"ref38","first-page":"231","article-title":"Boolean relations and the incomplete specification of logic networks","author":"brayton","year":"1989","journal-title":"Proc Int Conf Very Large Scale Integration Design"},{"key":"ref33","first-page":"109","article-title":"New generalizations of shannon decomposition","author":"kerntopf","year":"2001","journal-title":"Proc 4th Int Workshop Appl Reed Muller Expansion Circuit Des"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.12.010"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2821-6"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2017.90"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/VLSI-SoC.2013.6673260"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.165"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2008.105"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/VLSISOC.2006.313248"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.816216"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/54.867894"},{"key":"ref11","first-page":"37","article-title":"AOXMIN-MV: A heuristic algorithm for AND-OR-XOR minimization","author":"dubrova","year":"1999","journal-title":"Proc 4th Int Workshop Appl Reed Muller Expansion Circuit Des"},{"key":"ref12","first-page":"1214","article-title":"New three-level boolean expression based on EXOR gates","author":"ishikawa","year":"2004","journal-title":"IEICE Trans Inf Syst"},{"key":"ref13","first-page":"101","article-title":"On the complexity of three-level logic circuits","author":"sasao","year":"1989","journal-title":"Proc Int Workshop Logic Synthesis"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.7873\/DATE.2013.211"},{"key":"ref15","first-page":"425","article-title":"Fast three-level logic minimization based on autosymmetry","author":"bernasconi","year":"2002","journal-title":"ACM\/IEEE 39th Des Autom Conf"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2009.5090894"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7518-8_2"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2012.107"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.7873\/DATE.2013.208"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1391469.1391634"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2488484"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1023\/B:AIRE.0000006608.31990.cd"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2506566"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0817-5_2"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/378239.378353"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2664059"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147048"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/92.250190"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.923072"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9260(94)00007-7"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1344418.1344431"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.814950"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2011.11.009"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2409849"},{"year":"2018","key":"ref41"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9009-6"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.811447"},{"key":"ref25","first-page":"816","article-title":"QBF-based boolean function Bi-Decomposition","author":"chen","year":"2012","journal-title":"Proc Conf Des Autom Test Eur"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/8790822\/08669949.pdf?arnumber=8669949","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:48:52Z","timestamp":1657745332000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8669949\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,1]]},"references-count":41,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tc.2019.2906201","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"type":"print","value":"0018-9340"},{"type":"electronic","value":"1557-9956"},{"type":"electronic","value":"2326-3814"}],"subject":[],"published":{"date-parts":[[2019,9,1]]}}}