{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:04:19Z","timestamp":1775282659379,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1983,11,1]],"date-time":"1983-11-01T00:00:00Z","timestamp":436492800000},"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":[[1983,11]]},"DOI":"10.1016\/0020-0190(83)90044-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"215-217","source":"Crossref","is-referenced-by-count":143,"title":["BPP and the polynomial hierarchy"],"prefix":"10.1016","volume":"17","author":[{"given":"Clemens","family":"Lautemann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(83)90044-3_BIB1","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracle A, PA\u2260NPA\u2260CoNpA with probability 1","volume":"10","author":"Bennett","year":"1981","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/0020-0190(83)90044-3_BIB2","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/0020-0190(83)90044-3_BIB3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(82)90139-9","article-title":"Some observations on the probabilistic algorithms and NP-hard problems","volume":"14","author":"Ko","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(83)90044-3_BIB4","article-title":"On two computational models for probabilistic algorithms","author":"Lautemann","year":"1982"},{"key":"10.1016\/0020-0190(83)90044-3_BIB5","first-page":"330","article-title":"A complexity theoretic approach to randomness","author":"Sipser","year":"1983","journal-title":"Proc. 15th Ann. ACM Symp. on Theoretical Computer Science"},{"key":"10.1016\/0020-0190(83)90044-3_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(83)90044-3_BIB7","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0166-218X(83)90023-9","article-title":"Randomized algorithms","volume":"5","author":"Welsh","year":"1983","journal-title":"Discr. Appl. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900443?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900443?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:56:54Z","timestamp":1555088214000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019083900443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,11]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1983,11]]}},"alternative-id":["0020019083900443"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90044-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,11]]}}}