{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T23:34:03Z","timestamp":1649201643351},"reference-count":5,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"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":[[1993,4]]},"DOI":"10.1016\/0020-0190(93)90036-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"275-278","source":"Crossref","is-referenced-by-count":2,"title":["Honest iteration schemes of randomizing algorithms"],"prefix":"10.1016","volume":"45","author":[{"given":"Jie","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jay","family":"Belanger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90036-9_BIB1","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/3-540-54967-6_58","article-title":"Randomizing reductions of search problems","author":"Blass","year":"1991","journal-title":"Proc. of Foundations of Software Technology and Theoretical Computer Science"},{"key":"10.1016\/0020-0190(93)90036-9_BIB2","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/0022-0000(91)90007-R","article-title":"Average case completeness","volume":"42","author":"Gurevich","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(93)90036-9_BIB3","first-page":"812","article-title":"No better ways to generate hard NP instances then picking uniformly at random","author":"Impagliazzo","year":"1990","journal-title":"Proc. 31th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90036-9_BIB4","first-page":"217","article-title":"Random instances of a graph coloring problem are hard","author":"Venkatesan","year":"1988","journal-title":"Proc. 20th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(93)90036-9_BIB5","first-page":"259","article-title":"Honest iteration schemes of randomizing algorithms","volume":"650","author":"Wang","year":"1992"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093900369?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093900369?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:26:53Z","timestamp":1555144013000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019093900369"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["0020019093900369"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90036-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}