{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:29:56Z","timestamp":1754152196996,"version":"3.41.2"},"reference-count":5,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[1986,8,1]],"date-time":"1986-08-01T00:00:00Z","timestamp":523238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1986,8,1]],"date-time":"1986-08-01T00:00:00Z","timestamp":523238400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1986,8,1]],"date-time":"1986-08-01T00:00:00Z","timestamp":523238400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1986,8]]},"DOI":"10.1109\/tc.1986.1676828","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"761-762","source":"Crossref","is-referenced-by-count":12,"title":["Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification"],"prefix":"10.1109","volume":"C-35","author":[{"family":"McMullen","sequence":"first","affiliation":[{"name":"Department of Mathematics, Massachusetts Institute of Technology"}]},{"family":"Shearer","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(77)90012-3"},{"journal-title":"Logic Design and Switching Theory","year":"1979","author":"muroga","key":"ref3"},{"key":"ref5","first-page":"229","article-title":"the problem of bounding the length of reduced disjunctive normal forms","volume":"7","author":"yablonskii","year":"1962","journal-title":"Problemy Kibernet"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1964.263776"},{"key":"ref1","first-page":"389","article-title":"an improved lower bound on the maximum number of prime implicants","volume":"e 62","author":"igarashi","year":"1979","journal-title":"Trans IECE Japan"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35258\/01676828.pdf?arnumber=1676828","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:05:20Z","timestamp":1753121120000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1676828\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,8]]},"references-count":5,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tc.1986.1676828","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"type":"print","value":"0018-9340"},{"type":"electronic","value":"1557-9956"},{"type":"electronic","value":"2326-3814"}],"subject":[],"published":{"date-parts":[[1986,8]]}}}