{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T22:56:10Z","timestamp":1776984970683,"version":"3.51.4"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12981,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1978]]},"DOI":"10.1016\/0012-365x(78)90168-1","type":"journal-article","created":{"date-parts":[[2004,1,6]],"date-time":"2004-01-06T10:48:13Z","timestamp":1073386093000},"page":"7-11","source":"Crossref","is-referenced-by-count":63,"title":["On the number of prime implicants"],"prefix":"10.1016","volume":"24","author":[{"given":"Ashok K.","family":"Chandra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Markowsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(78)90168-1_BIB1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.2307\/2964570","article-title":"The problem of simplifying logical expressions","volume":"24","author":"Dunham","year":"1959","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0012-365X(78)90168-1_BIB2","series-title":"Introduction to Switching and Automata Theory","author":"Harrison","year":"1965"},{"key":"10.1016\/0012-365X(78)90168-1_BIB3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(71)90006-9","article-title":"Maximal sized antichains in partial orders","author":"Kleitman","year":"1971","journal-title":"Discrete Math."},{"issue":"6","key":"10.1016\/0012-365X(78)90168-1_BIB4","doi-asserted-by":"crossref","first-page":"1445","DOI":"10.1002\/j.1538-7305.1956.tb03836.x","article-title":"Minimization of Boolean functions","volume":"35","author":"McCluskey","year":"1956","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0012-365X(78)90168-1_BIB5","volume":"Vol. I","author":"Miller","year":"1965"},{"issue":"8","key":"10.1016\/0012-365X(78)90168-1_BIB6","doi-asserted-by":"crossref","first-page":"521","DOI":"10.2307\/2308219","article-title":"A way to simplify truth functions","volume":"59","author":"Quine","year":"1952","journal-title":"Am. Math. Monthly"},{"key":"10.1016\/0012-365X(78)90168-1_BIB7","first-page":"151","article-title":"Estimate of the number of conjunctions in reduced d.n.f.","volume":"28","author":"Vikulin","year":"1974","journal-title":"Problemy Kibernet"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78901681?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78901681?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T19:27:57Z","timestamp":1550258877000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X78901681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978]]}},"alternative-id":["0012365X78901681"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(78)90168-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}