{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T05:46:24Z","timestamp":1648964784783},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"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":8417,"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":[[1990,7]]},"DOI":"10.1016\/0166-218x(90)90095-t","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:02:11Z","timestamp":1027652531000},"page":"71-81","source":"Crossref","is-referenced-by-count":0,"title":["The complexity of determinacy problem on group testing"],"prefix":"10.1016","volume":"28","author":[{"given":"Feng","family":"Yang","sequence":"first","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90095-T_BIB1","doi-asserted-by":"crossref","first-page":"4436","DOI":"10.1214\/aoms\/1177731363","article-title":"The detection of defective members in large population","volume":"14","author":"Dorfman","year":"1943","journal-title":"Ann. Math. Statist."},{"issue":"4","key":"10.1016\/0166-218X(90)90095-T_BIB2","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1137\/0608062","article-title":"Some completeness results on decision trees and group testing","volume":"8","author":"Du","year":"1987","journal-title":"SIAM. J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(90)90095-T_BIB3","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1137\/0602045","article-title":"Hypergeometric group testing and generalized hypergeometric group testing problems","volume":"2","author":"Hwang","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(90)90095-T_BIB4","series-title":"Combinatorial Optimization: Algorithm and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0166-218X(90)90095-T_BIB5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"9","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090095T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090095T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T23:53:29Z","timestamp":1555199609000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090095T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,7]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,7]]}},"alternative-id":["0166218X9090095T"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90095-t","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,7]]}}}