{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T10:14:37Z","timestamp":1672568077795},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1986,10,1]],"date-time":"1986-10-01T00:00:00Z","timestamp":528508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":9787,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1986,10]]},"DOI":"10.1016\/s0019-9958(86)80020-1","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T20:43:56Z","timestamp":1115412236000},"page":"131-142","source":"Crossref","is-referenced-by-count":5,"title":["On the power of two-way random generators and the impossibility of deterministic poly-space simulation"],"prefix":"10.1016","volume":"71","author":[{"given":"Marek","family":"Karpinski","sequence":"first","affiliation":[]},{"given":"Rutger","family":"Verbeek","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(86)80020-1_bib1","series-title":"Proc. 9th ACM STOC","first-page":"151","article-title":"Reducibility, randomness and intractibility","author":"Adleman","year":"1977"},{"key":"10.1016\/S0019-9958(86)80020-1_bib2","doi-asserted-by":"crossref","first-page":"96","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\/S0019-9958(86)80020-1_bib3","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracle A, PA \u2260 NPA \u2260 co \u2212 NPA with probability 1","volume":"10","author":"Benett","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(86)80020-1_bib4","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0019-9958(82)90439-9","article-title":"On the Unique Satisfiability Problem","volume":"55","author":"Blass","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/S0019-9958(86)80020-1_bib5","series-title":"Proc. 14th ACM STOC","first-page":"310","article-title":"Isomorphism of Graphs with bounded eigenvalue multiplicity","author":"Babai","year":"1982"},{"key":"10.1016\/S0019-9958(86)80020-1_bib6","series-title":"Proc. 23rd IEEE FOCS","first-page":"112","article-title":"How to generate cryptographically strong sequences of pseudo random bits","author":"Blum","year":"1982"},{"key":"10.1016\/S0019-9958(86)80020-1_bib7","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(86)80020-1_bib8","series-title":"Proc. 11th ACM STOC","first-page":"330","article-title":"Deterministic CFLs are accepted simultaneously in polynomial time and log squared tape","author":"Cook","year":"1979"},{"key":"10.1016\/S0019-9958(86)80020-1_bib9","series-title":"Proc. Foundations of Computation Theory","first-page":"78","article-title":"The classification of problems which have fast parallel algorithms","volume":"Vol. 158","author":"Cook","year":"1983"},{"key":"10.1016\/S0019-9958(86)80020-1_bib10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0019-9958(85)80043-7","article-title":"Pseudorandom number generation and space complexity","volume":"64","author":"Furst","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/S0019-9958(86)80020-1_bib11","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."},{"key":"10.1016\/S0019-9958(86)80020-1_bib12","series-title":"Proc. 25th IEEE FOCS","first-page":"323","article-title":"A lower bound for probabilistic algorithms for finite state machines","author":"Greenberg","year":"1984"},{"key":"10.1016\/S0019-9958(86)80020-1_bib13","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0019-9958(86)80020-1_bib14","series-title":"Proc. 10th MFCS","first-page":"339","article-title":"Relationships between probabilistic and deterministic tape complexity","volume":"Vol. 118","author":"Jung","year":"1981"},{"key":"10.1016\/S0019-9958(86)80020-1_bib15","series-title":"Proc. 10th ACM STOC","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/S0019-9958(86)80020-1_bib16","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/S0019-9958(85)80032-2","article-title":"There Is No Polynomial Deterministic Space Simulation of Probabilistic Space with Two-Way Random-Tape Generator","volume":"67","author":"Karpinski","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/S0019-9958(86)80020-1_bib17","article-title":"Probabilistic NC1-Circuits Equal Probabilistic Polynomial Time","author":"Karpinski","year":"1985"},{"key":"10.1016\/S0019-9958(86)80020-1_bib18","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1145\/62.322435","article-title":"On the Complexity of Unique Solutions","volume":"31","author":"Papadimitriou","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(86)80020-1_bib19","series-title":"Proc. 14th ACM STOC","first-page":"255","article-title":"The Complexity of facets (and some facets of complexity)","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0019-9958(86)80020-1_bib20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circut complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/S0019-9958(86)80020-1_bib21","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(86)80020-1_bib22","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0022-0000(84)90017-5","article-title":"Consistency in nondeterministic storage","volume":"29","author":"Savitch","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(86)80020-1_bib23","series-title":"Proc. 15th ACM STOC","first-page":"330","article-title":"A complexity theoretic approach to randomness","author":"Sipser","year":"1983"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995886800201?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995886800201?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T17:54:23Z","timestamp":1548525263000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995886800201"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,10]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1986,10]]}},"alternative-id":["S0019995886800201"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(86)80020-1","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1986,10]]}}}