{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T07:52:58Z","timestamp":1775461978605,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"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":12616,"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":[[1979]]},"DOI":"10.1016\/0012-365x(79)90074-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:33:13Z","timestamp":1027639993000},"page":"103-105","source":"Crossref","is-referenced-by-count":11,"title":["The covering problem of complete uniform hypergraphs"],"prefix":"10.1016","volume":"27","author":[{"given":"Marc","family":"Snir","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(79)90074-8_BIB1","first-page":"6037","article-title":"Nombre minimal de contacts de fermeture n\u00e9cessaire pour r\u00e9aliser une fonction bool\u00e9enne sym\u00e9trique de n variables","volume":"258","author":"Hansel","year":"1964","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/0012-365X(79)90074-8_BIB2","first-page":"1140","article-title":"Complexity bounds for the realization of monotomic symmetrical functions by means of formulas in the basis +, \u2212, \u00b7","volume":"14","author":"Khasin","year":"1970","journal-title":"Soviet Physics, Dokladi"},{"key":"10.1016\/0012-365X(79)90074-8_BIB3","first-page":"770","article-title":"Complexity of contact circuits realizing a function of logical algebra","volume":"8","author":"Krichevskii","year":"1964","journal-title":"Soviet Physics, Dokladi"},{"key":"10.1016\/0012-365X(79)90074-8_BIB4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0097-3165(77)90083-8","article-title":"An information theoretic method in combinatorial theory","volume":"23","author":"Pippenger","year":"1977","journal-title":"J. Combinatorial Theory (A)"},{"key":"10.1016\/0012-365X(79)90074-8_BIB5","series-title":"IBM Res. Rept. RC 5405","article-title":"Short monotone formulae for threshold functions","author":"Pippenger","year":"1975"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X79900748?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X79900748?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:22:57Z","timestamp":1555140177000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X79900748"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979]]}},"alternative-id":["0012365X79900748"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(79)90074-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1979]]}}}