{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T16:46:47Z","timestamp":1648745207204},"reference-count":4,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0020-0190(02)00453-2","type":"journal-article","created":{"date-parts":[[2003,2,28]],"date-time":"2003-02-28T09:44:40Z","timestamp":1046425480000},"page":"27-32","source":"Crossref","is-referenced-by-count":1,"title":["Verifying minimum stable circuit values"],"prefix":"10.1016","volume":"86","author":[{"given":"C.K.","family":"Poon","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00453-2_BIB001","unstructured":"M. Blum, R. Rue, and K. Yang, On the complexity of max\/min\/avrg circuits, Technical Report CMU-CS-02-110, Carnegie Mellon University, Pittsburgh, PA, March 2002"},{"issue":"1","key":"10.1016\/S0020-0190(02)00453-2_BIB002","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0020-0190(02)00453-2_BIB003","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","article-title":"The complexity of stochastic games","volume":"96","author":"Condon","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(02)00453-2_BIB004","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1006\/inco.1995.1035","article-title":"A subexponential randomized algorithm for the simple stochastic game problem","volume":"117","author":"Ludwig","year":"1995","journal-title":"Inform. and Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004532?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004532?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T10:27:49Z","timestamp":1553941669000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002004532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0020019002004532"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00453-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}