{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:41:15Z","timestamp":1773247275699,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.23919\/date48585.2020.9116467","type":"proceedings-article","created":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T23:28:37Z","timestamp":1592263717000},"page":"568-573","source":"Crossref","is-referenced-by-count":22,"title":["A Logic Synthesis Toolbox for Reducing the Multiplicative Complexity in Logic Networks"],"prefix":"10.23919","author":[{"given":"Eleonora","family":"Testa","sequence":"first","affiliation":[]},{"given":"Mathias","family":"Soeken","sequence":"additional","affiliation":[]},{"given":"Heinz","family":"Riener","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Amaru","sequence":"additional","affiliation":[]},{"given":"Giovanni De","family":"Micheli","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","article-title":"The EPFL combi-national benchmark suite","author":"amar\u00f9","year":"2015","journal-title":"Int’ I Workshop on Logic Synth"},{"key":"ref10","first-page":"475","article-title":"Solving circuit optimisation problems in cryptography and cryptanalysis","volume":"2011","author":"courtois","year":"2011","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133997"},{"key":"ref13","first-page":"1069","article-title":"Zkboo: Faster zero-knowledge for Boolean circuits","author":"giacomelli","year":"2016","journal-title":"Security Symposium"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.32"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD45719.2019.8942093"},{"key":"ref17","article-title":"Yosys Open SYnthesis Suite","author":"wolf","year":"0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317905"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.01.030"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.1962.16"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-012-9124-7"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/378239.378353"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/JPROC.2018.2869760","article-title":"Logic synthesis for established and emerging computing","volume":"107","author":"testa","year":"2018","journal-title":"Proceedings of the IEEE"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2019.8740831"},{"key":"ref29","article-title":"The EPFL logic synthesis libraries","author":"soeken","year":"2018"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317893"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16363-5_2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-31511-5_10"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/978-3-642-14295-6_5","article-title":"ABC: an academic industrialstrength verification tool","author":"brayton","year":"2010","journal-title":"Computer Aided Verification"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53140-2_22"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1987.1270347"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147048"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/275107.275118"},{"key":"ref21","first-page":"1649","article-title":"On-the-fly and DAG-aware: Rewriting Boolean networks with exact synthesis","author":"riener","year":"2019","journal-title":"Design Automation and Test in Europe"},{"key":"ref24","article-title":"The multiplicative complexity of 6-variable Boolean functions","author":"calik","year":"2018","journal-title":"Cryptology ePrint Archive Report"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-20323-8_9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3232195.3232202"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2018.8342108"}],"event":{"name":"2020 Design, Automation & Test in Europe Conference & Exhibition (DATE)","location":"Grenoble, France","start":{"date-parts":[[2020,3,9]]},"end":{"date-parts":[[2020,3,13]]}},"container-title":["2020 Design, Automation & Test in Europe Conference & Exhibition (DATE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9112295\/9116186\/09116467.pdf?arnumber=9116467","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,20]],"date-time":"2020-07-20T22:08:36Z","timestamp":1595282916000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9116467\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":30,"URL":"https:\/\/doi.org\/10.23919\/date48585.2020.9116467","relation":{},"subject":[],"published":{"date-parts":[[2020,3]]}}}