{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T03:43:36Z","timestamp":1649043816685},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":4307,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0166-218x(00)00367-x","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"147-153","source":"Crossref","is-referenced-by-count":0,"title":["On minimal coverings of the Boolean cube by centered antichains"],"prefix":"10.1016","volume":"114","author":[{"given":"O.M.","family":"Kasim-Zade","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00367-X_BIB1","unstructured":"Discrete Mathematics and Mathematical Problems of Cybernetics 1, Moscow, Nauka, 1974 (in Russian)."},{"issue":"25","key":"10.1016\/S0166-218X(00)00367-X_BIB2","first-page":"6037","article-title":"Nombre minimal de contacts de fermeture n\u00e9cessaires pour r\u00e9aliser une fonction bool\u00e9enne sym\u00e9trique de n variables","volume":"258","author":"Hansel","year":"1964","journal-title":"C. R. Acad. Sci."},{"issue":"21","key":"10.1016\/S0166-218X(00)00367-X_BIB3","first-page":"4297","article-title":"Nombre de lettres n\u00e9cessaire pour \u00e9crire une fonction sym\u00e9trique de n variables","volume":"261","author":"Hansel","year":"1965","journal-title":"C. R. Acad. Sci."},{"key":"10.1016\/S0166-218X(00)00367-X_BIB4","unstructured":"O.M. Kasim-Zade, On a metric characteristic of implicit and parametric representations of Boolean functions, Matematicheskie Voprosy Kibernetiki 6, Moscow, Nauka, 1996, pp. 133\u2013188."},{"issue":"3","key":"10.1016\/S0166-218X(00)00367-X_BIB5","first-page":"342","article-title":"The mean length of a binary code with minimal redundancy in the case when probabilities of coded symbols are close to each other","volume":"7","author":"Kislitsyn","year":"1962","journal-title":"Teoriya veroyatnostei i ee primeneniya"},{"key":"10.1016\/S0166-218X(00)00367-X_BIB6","unstructured":"R.E. Krichevskii, Minimal circuit of closing contacts for a Boolean function of n variables, Diskretnyi analiz 5, Institut matematiki SO AN SSSR, Novosibirsk, 1965, pp. 89\u201392."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0000367X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0000367X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T20:25:40Z","timestamp":1556223940000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0000367X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X0000367X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00367-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}