{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:40:09Z","timestamp":1752104409628,"version":"3.41.2"},"reference-count":5,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[1979,12,1]],"date-time":"1979-12-01T00:00:00Z","timestamp":312854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1979,12,1]],"date-time":"1979-12-01T00:00:00Z","timestamp":312854400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1979,12,1]],"date-time":"1979-12-01T00:00:00Z","timestamp":312854400000},"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":[[1979,12]]},"DOI":"10.1109\/tc.1979.1675286","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"941-943","source":"Crossref","is-referenced-by-count":6,"title":["The Computational Complexity of a Class of Minimization Algorithms for Switching Functions"],"prefix":"10.1109","volume":"C-28","author":[{"family":"Breitbart","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Wisconsin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Vairavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"On the number of prime implicants","year":"1977","author":"chandra","key":"ref4"},{"key":"ref3","volume":"i","author":"miller","year":"1965","journal-title":"Switching Theory"},{"key":"ref5","article-title":"on number of prime implicants of a boolean function","volume":"29","author":"vikulin","year":"1973","journal-title":"Problems Kibernetika"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1978.1674997"},{"key":"ref1","article-title":"a new technique for the fast minimization of switching functions","volume":"c 26","author":"rhgue","year":"1977","journal-title":"IEEE Trans Comput"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35177\/01675286.pdf?arnumber=1675286","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:08:46Z","timestamp":1752102526000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1675286\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,12]]},"references-count":5,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tc.1979.1675286","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":[[1979,12]]}}}