{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:11:31Z","timestamp":1742998291363,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":9,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_446","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:04:14Z","timestamp":1461269054000},"page":"1477-1481","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Two-Level Boolean Minimization"],"prefix":"10.1007","author":[{"given":"Robert P.","family":"Dick","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"issue":"2","key":"263_CR15216","first-page":"264","volume":"78","author":"RK Brayton","year":"1990","unstructured":"Brayton RK, Hachtel GD, Sangiovanni-Vincentelli AL (1990) Multilevel logic synthesis. Proc\u00a0IEEE 78(2):264\u2013300","journal-title":"Proc\u00a0IEEE"},{"key":"263_CR15217","first-page":"641","volume-title":"New ideas for solving covering problems","author":"O Coudert","year":"1995","unstructured":"Coudert O, Madre JC (1995) New ideas for solving covering problems. In: Proceedings of the design automation conference, San Francisco, pp 641\u2013646"},{"issue":"4","key":"263_CR15218","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1109\/PGEC.1965.263993","volume":"14","author":"JF Gimpel","year":"1965","unstructured":"Gimpel JF (1965) A reduction technique for prime implicant tables. IEEE Trans Electron Comput 14(4):535\u2013541","journal-title":"IEEE Trans Electron Comput"},{"key":"263_CR15219","first-page":"593","volume":"72","author":"M Karnaugh","year":"1953","unstructured":"Karnaugh M (1953) The map method for synthesis of combinational logic circuits. Trans\u00a0AIEE Commun Electron 72:593\u2013599","journal-title":"Trans\u00a0AIEE Commun Electron"},{"key":"263_CR15220","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, New York, pp\u00a085\u2013103"},{"issue":"6","key":"263_CR15221","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1002\/j.1538-7305.1956.tb03835.x","volume":"35","author":"EJ McCluskey","year":"1956","unstructured":"McCluskey EJ (1956) Minimization of Boolean functions. Bell Syst Tech J 35(6):1417\u20131444","journal-title":"Bell Syst Tech J"},{"issue":"8","key":"263_CR15222","doi-asserted-by":"publisher","first-page":"521","DOI":"10.2307\/2308219","volume":"59","author":"WV Quine","year":"1952","unstructured":"Quine WV (1952) The problem of simplyfying truth functions. Am Math Mon 59(8):521\u2013531","journal-title":"Am Math Mon"},{"issue":"9","key":"263_CR15223","doi-asserted-by":"publisher","first-page":"627","DOI":"10.2307\/2307285","volume":"62","author":"WV Quine","year":"1955","unstructured":"Quine WV (1955) A way to simplify truth functions. Am Math Mon 62(9):627\u2013631","journal-title":"Am Math Mon"},{"issue":"7","key":"263_CR15224","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/TCAD.2005.855944","volume":"25","author":"C Umans","year":"2006","unstructured":"Umans C, Villa T, Sangiovanni-Vincentelli AL (2006) Complexity of two-level logic minimization. IEEE Trans Comput-Aided Des Integr Circuits Syst 25(7):1230\u20131246","journal-title":"IEEE Trans Comput-Aided Des Integr Circuits Syst"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T16:12:34Z","timestamp":1553098354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_446","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}