{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:26:26Z","timestamp":1729650386442,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icvd.2004.1261022","type":"proceedings-article","created":{"date-parts":[[2004,6,21]],"date-time":"2004-06-21T17:52:40Z","timestamp":1087840360000},"page":"765-768","source":"Crossref","is-referenced-by-count":1,"title":["Boolean decomposition using two-literal divisors"],"prefix":"10.1109","author":[{"given":"N.","family":"Modi","sequence":"first","affiliation":[]},{"given":"J.","family":"Cortadella","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Roth-Karp decomposition combining functional and structural techniques","author":"martinelli","year":"2003","journal-title":"Proc Int Workshop on Logic Synthesis"},{"key":"ref11","first-page":"44","article-title":"An exact and efficient algorithm for disjunctive de-composition","volume":"98","author":"matsunaga","year":"1998","journal-title":"SASIMI’"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3154-8_11"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1990.114954"},{"year":"1992","author":"sentovich","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/43.310907"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1990.129967"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.1998.669399"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/337292.337323"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1987.1270347"},{"key":"ref3","first-page":"49","article-title":"The decomposition and factorization of Boolean expressions","author":"brayton","year":"1982","journal-title":"Proc of the Int Symp on Circuits and Systems"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0111022"},{"year":"0","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1994.629735"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/277044.277140"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2821-6","article-title":"Logic Minimization Algorithms for VLSI Synthesis","author":"brayton","year":"1984"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1997.643371"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1109\/43.511577","article-title":"OBDD-based function de-composition: algorithms and implementation","volume":"15","author":"lai","year":"1996","journal-title":"IEEE Trans on Comnuter-Aided Design"}],"event":{"name":". 17th International Conference on VLSI Design","acronym":"ICVD-04","location":"Mumbai, India"},"container-title":["17th International Conference on VLSI Design. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8911\/28180\/01261022.pdf?arnumber=1261022","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T04:12:10Z","timestamp":1497586330000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1261022\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/icvd.2004.1261022","relation":{},"subject":[]}}