{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T05:47:48Z","timestamp":1747892868493},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":6407,"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":[[1996,1]]},"DOI":"10.1016\/0304-3975(95)00127-1","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"23-39","source":"Crossref","is-referenced-by-count":3,"title":["On randomized versus deterministic computation"],"prefix":"10.1016","volume":"154","author":[{"given":"Marek","family":"Karpinski","sequence":"first","affiliation":[]},{"given":"Rutger","family":"Verbeek","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00127-1_BIB1","series-title":"Proc. 19th IEEE FOCS","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978"},{"key":"10.1016\/0304-3975(95)00127-1_BIB2","series-title":"Proc. 9th ACM STOC","first-page":"151","article-title":"Reducibility, randomness, and intractibility","author":"Adleman","year":"1977"},{"key":"10.1016\/0304-3975(95)00127-1_BIB3_1","series-title":"Almost-everywhere complexity hierarchies for nondeterministic time","author":"Allender","year":"1992"},{"key":"10.1016\/0304-3975(95)00127-1_BIB3_2","series-title":"Proc. STAGS '90","first-page":"1","volume":"Vol. 415","author":"Allender","year":"1990"},{"key":"10.1016\/0304-3975(95)00127-1_BIB4","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracle A, PA \u2260 NPA \u2260 co-NPA with probability 1","volume":"10","author":"Bennett","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00127-1_BIB5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0019-9958(83)80060-6","article-title":"Parallel computation for well endowed rings and space bounded probabilistic machines","volume":"58","author":"Borodin","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)00127-1_BIB6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)00127-1_BIB7","unstructured":"L. Fortnow, personal communication, 1992."},{"key":"10.1016\/0304-3975(95)00127-1_BIB8","series-title":"Proc. 21st ACM STOC","first-page":"148","article-title":"Probabilistic computation and linear time","author":"Fortnow","year":"1989"},{"key":"10.1016\/0304-3975(95)00127-1_BIB9","series-title":"Proc. MFCS '79","first-page":"57","article-title":"Fast probabilistic algorithms","volume":"Vol. 75","author":"Freivalds","year":"1979"},{"key":"10.1016\/0304-3975(95)00127-1_BIB10","series-title":"Algorithms and Complexity","first-page":"69","article-title":"A catalog of complexity classes","volume":"Vol. A","author":"Johnson","year":"1990"},{"key":"10.1016\/0304-3975(95)00127-1_BIB11","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0019-9958(82)90382-5","article-title":"Circuit-size lower bounds and bon-reducibility to sparse sets","volume":"55","author":"Kannan","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)00127-1_BIB12","series-title":"Algorithms and Complexity","first-page":"869","article-title":"Parallel algorithms for shared-memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/0304-3975(95)00127-1_BIB13","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/0890-5401(87)90057-5","article-title":"On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes","volume":"75","author":"Karpinski","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(95)00127-1_BIB14","series-title":"Computation Theory and Logic","first-page":"189","article-title":"Randomness, provability and the separation of Monte Carlo time and space","volume":"Vol. 270","author":"Karpinski","year":"1988"},{"key":"10.1016\/0304-3975(95)00127-1_BIB15","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/322290.322306","article-title":"Relational questions involving probabilistic algorithms","volume":"29","author":"Rackoff","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00127-1_BIB16","series-title":"Proc. 15th ACM STOC","first-page":"330","article-title":"A complexity theoretic approach to randomness","author":"Sipser","year":"1983"},{"key":"10.1016\/0304-3975(95)00127-1_BIB17","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1137\/0214060","article-title":"On approximation algorithms for #P","volume":"14","author":"Stockmeyer","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00127-1_BIB18","series-title":"Proc. 24th IEEE FOCS","first-page":"329","article-title":"Relativized circuit complexity","author":"Wilson","year":"1983"},{"key":"10.1016\/0304-3975(95)00127-1_BIB19","series-title":"Proc. 22nd ACM STOC","first-page":"84","article-title":"Coherent functions and program checkers","author":"Yao","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001271?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001271?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:52:18Z","timestamp":1555419138000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["0304397595001271"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00127-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}