{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T08:13:16Z","timestamp":1648541596365},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"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":9329,"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":[[1988]]},"DOI":"10.1016\/0012-365x(88)90088-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"137-147","source":"Crossref","is-referenced-by-count":8,"title":["A polynomial algorithm for constructing families of k-independent sets"],"prefix":"10.1016","volume":"70","author":[{"given":"G.","family":"Freiman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Lipkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Levitin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(88)90088-X_BIB1","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0012-365X(73)90098-8","article-title":"Families of k-independent sets","volume":"6","author":"Kleitman","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(88)90088-X_BIB2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0012-365X(86)90161-5","article-title":"Explicit construction of exponential sized families of k-independent sets","volume":"58","author":"Alon","year":"1986","journal-title":"Discrete Math"},{"key":"10.1016\/0012-365X(88)90088-X_BIB3","series-title":"IEEE Internat. Symp. Inform. Theory","article-title":"Efficient exhaustive test based on MDS codes","author":"Levitin","year":"1986"},{"key":"10.1016\/0012-365X(88)90088-X_BIB4","article-title":"On sets of Boolean n-vectors with all k-projections surjective","author":"Chandra","year":"1981","journal-title":"IBM Research Report"},{"key":"10.1016\/0012-365X(88)90088-X_BIB5","article-title":"Exhaustive bit pattern generation in discontinuous positions, with applications to VLSI self-testing","author":"Barzilai","year":"1981","journal-title":"IBM Research Report RC-8750"},{"key":"10.1016\/0012-365X(88)90088-X_BIB6","article-title":"Efficient exhaustive pattern generation for logic design","author":"Tang","year":"1983","journal-title":"IBM Research Report RC-10064"},{"key":"10.1016\/0012-365X(88)90088-X_BIB7","article-title":"Exhaustive testing of circuits with outputs depending on limited number of inputs","author":"Cohen","year":"1984","journal-title":"IEEE Internat. Information Workshop"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X8890088X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X8890088X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:27:12Z","timestamp":1555133232000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X8890088X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988]]}},"alternative-id":["0012365X8890088X"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(88)90088-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1988]]}}}