{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T00:02:33Z","timestamp":1746316953519,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1109\/sbcci.2013.6644862","type":"proceedings-article","created":{"date-parts":[[2013,10,30]],"date-time":"2013-10-30T20:12:39Z","timestamp":1383163959000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["Read-polarity-once Boolean functions"],"prefix":"10.1109","author":[{"given":"Vinicius","family":"Callegaro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mayler G. A.","family":"Martins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato P.","family":"Ribas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andre I.","family":"Reis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2010.5456946"},{"journal-title":"SIS A system for sequential circuit synthesis","year":"1992","author":"sentovich","key":"17"},{"journal-title":"Berkeley Logic Synthesis and Verification Group","year":"0","key":"18"},{"key":"15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2821-6","author":"brayton","year":"1984","journal-title":"Logic Minimization Algorithms for VLSI Synthesis"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"journal-title":"Benchmarks","year":"2005","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321918"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2007.358023"},{"key":"12","article-title":"Minimal decomposition of Boolean functionsusing non-repeating literal trees","author":"peer","year":"1995","journal-title":"IFIP"},{"key":"3","first-page":"195","article-title":"Factoring logic functions using graphpartitioning","author":"golumbic","year":"1999","journal-title":"ICCAD"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2010.5647772"},{"key":"2","first-page":"564","author":"hachtel","year":"2006","journal-title":"Logic Synthesis and VerificationAlgorithms"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.02.011"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.312.0187"},{"key":"7","first-page":"1065","article-title":"Exact minimum logic factoringvia quantified Boolean satisfiability","author":"yoshida","year":"2006","journal-title":"Proc of IEEE Int'l Conf OnElectronics Circuits and Systems (ICECS)"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/321229.321232"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/43.310907"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.02.007"},{"key":"9","first-page":"109","article-title":"Factoring and recognition ofread-once functions using cographs and normality","author":"golumbic","year":"2001","journal-title":"DAC"},{"key":"8","doi-asserted-by":"crossref","first-page":"70","DOI":"10.2197\/ipsjtsldm.4.70","article-title":"Exact minimum factoring of incompletelyspecified logic functions via quantified Boolean satisfiability","volume":"4","author":"yoshida","year":"2011","journal-title":"IPSJTrans on System LSI Design Methodology"}],"event":{"name":"2013 26th Symposium on Integrated Circuits and Systems Design (SBCCI)","start":{"date-parts":[[2013,9,2]]},"location":"Curitiba, Brazil","end":{"date-parts":[[2013,9,6]]}},"container-title":["2013 26th Symposium on Integrated Circuits and Systems Design (SBCCI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6634599\/6644849\/06644862.pdf?arnumber=6644862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T21:07:35Z","timestamp":1498079255000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6644862\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/sbcci.2013.6644862","relation":{},"subject":[],"published":{"date-parts":[[2013,9]]}}}