{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:28:03Z","timestamp":1742970483050,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":9,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_446","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:37:39Z","timestamp":1214505459000},"page":"989-993","source":"Crossref","is-referenced-by-count":0,"title":["Two-Level Boolean Minimization"],"prefix":"10.1007","author":[{"given":"Robert","family":"Dick","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"446_CR1_446","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1109\/5.52213","volume":"78","author":"R.K. Brayton","year":"1990","unstructured":"Brayton, R.K., Hachtel, G.D., Sangiovanni\u2010Vincentelli, A.L.: Multilevel logic synthesis. Proc. IEEE 78(2), 264\u2013300 (1990)","journal-title":"Proc. IEEE"},{"key":"446_CR2_446","doi-asserted-by":"crossref","unstructured":"Coudert, O., Madre, J.C.: New ideas for solving covering problems. In: Proc. Design Automation Conf., 1995, pp. 641\u2013646","DOI":"10.1145\/217474.217603"},{"issue":"4","key":"446_CR3_446","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1109\/PGEC.1965.263993","volume":"14","author":"J.F. Gimpel","year":"1965","unstructured":"Gimpel, J.F.: A reduction technique for prime implicant tables. IEEE Trans. Electron. Comput. 14(4), 535\u2013541 (1965)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"446_CR4_446","first-page":"593","volume":"72","author":"M. Karnaugh","year":"1953","unstructured":"Karnaugh, M.: The map method for synthesis of combinational logic circuits. Trans. AIEE, Commun. Electron. 72, 593\u2013599 (1953)","journal-title":"Trans. AIEE, Commun. Electron."},{"key":"446_CR5_446","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"6","key":"446_CR6_446","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1002\/j.1538-7305.1956.tb03835.x","volume":"35","author":"E.J. McCluskey","year":"1956","unstructured":"McCluskey, E.J.: Minimization of Boolean functions. Bell Syst. Tech.\u00a0J. 35(6), 1417\u20131444 (1956)","journal-title":"Bell Syst. Tech. J."},{"issue":"8","key":"446_CR7_446","doi-asserted-by":"publisher","first-page":"521","DOI":"10.2307\/2308219","volume":"59","author":"W.V. Quine","year":"1952","unstructured":"Quine, W.V.: The problem of simplyfying truth functions. Am. Math. Mon. 59(8), 521\u2013531 (1952)","journal-title":"Am. Math. Mon."},{"issue":"9","key":"446_CR8_446","doi-asserted-by":"publisher","first-page":"627","DOI":"10.2307\/2307285","volume":"62","author":"W.V. Quine","year":"1955","unstructured":"Quine, W.V.: A way to simplify truth functions. Am. Math. Mon. 62(9), 627\u2013631 (1955)","journal-title":"Am. Math. Mon."},{"issue":"7","key":"446_CR9_446","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1109\/TCAD.2005.855944","volume":"25","author":"C. Umans","year":"2006","unstructured":"Umans, C., Villa, T., Sangiovanni\u2010Vincentelli, A.L.: Complexity of two-level logic minimization. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 25(7), 1230\u20131246 (2006)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T01:54:39Z","timestamp":1662170079000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_446"}},"subtitle":["1956; McCluskey"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_446","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}