{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:51:28Z","timestamp":1742381488933},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,8,1]],"date-time":"1983-08-01T00:00:00Z","timestamp":428544000000},"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":10943,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1983,8]]},"DOI":"10.1016\/0304-3975(83)90004-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"291-300","source":"Crossref","is-referenced-by-count":24,"title":["A natural encoding scheme proved probabilistic polynomial complete"],"prefix":"10.1016","volume":"24","author":[{"given":"Umesh V.","family":"Vazirani","sequence":"first","affiliation":[]},{"given":"Vijay V.","family":"Vazirani","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90004-X_BIB1","first-page":"397","article-title":"Reductions that lie","author":"Adleman","year":"1979","journal-title":"Proc. 20th Ann. FOCS Conf."},{"key":"10.1016\/0304-3975(83)90004-X_BIB2","series-title":"Memo No. UCB\/ERL M78\/30","article-title":"Intractability proofs and the computational complexity of binary quadratics","author":"Adleman","year":"1978"},{"key":"10.1016\/0304-3975(83)90004-X_BIB3","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978","journal-title":"19th Ann. FOCS Conf."},{"issue":"3","key":"10.1016\/0304-3975(83)90004-X_BIB4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0019-9958(78)90683-6","article-title":"On the complexity of minimum inference of regular sets","volume":"39","author":"Angluin","year":"1978","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(83)90004-X_BIB5","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(83)90004-X_BIB6","first-page":"91","article-title":"Computational complexity of probabilistic Turing machines","author":"Gill","year":"1974","journal-title":"Conf. Records 6th ACM Symp. on Theory of Computing"},{"issue":"1","key":"10.1016\/0304-3975(83)90004-X_BIB7","article-title":"Three approaches to the concept of \u2018the amount of information\u2019","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Probab. Inform. Transm."},{"key":"10.1016\/0304-3975(83)90004-X_BIB8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial time reducibility","volume":"22","author":"Ladner","year":"1975","journal-title":"J. Assoc. Comput. Math."},{"issue":"5","key":"10.1016\/0304-3975(83)90004-X_BIB9","first-page":"1413","article-title":"On the notion of a random sequence","volume":"14","author":"Levin","year":"1973","journal-title":"Soviet Math. Dokl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758390004X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758390004X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:28:21Z","timestamp":1555126101000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758390004X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,8]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,8]]}},"alternative-id":["030439758390004X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90004-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983,8]]}}}