{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T06:31:38Z","timestamp":1676961098296},"reference-count":11,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1985,10,1]],"date-time":"1985-10-01T00:00:00Z","timestamp":496972800000},"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":10152,"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":[[1985,10]]},"DOI":"10.1016\/s0019-9958(85)80032-2","type":"journal-article","created":{"date-parts":[[2005,5,3]],"date-time":"2005-05-03T11:12:14Z","timestamp":1115118734000},"page":"158-162","source":"Crossref","is-referenced-by-count":8,"title":["There is no polynomial deterministic space simulation of probabilistic space with a two-way random-tape generator"],"prefix":"10.1016","volume":"67","author":[{"given":"Marek","family":"Karpinski","sequence":"first","affiliation":[]},{"given":"Rutger","family":"Verbeek","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(85)80032-2_bib1","series-title":"Proc. 9th ACM Sympos. Theory of Comput.","first-page":"151","article-title":"Reducibility, randomness and intractibility","author":"Adleman","year":"1977"},{"key":"10.1016\/S0019-9958(85)80032-2_bib2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine-independent theory of the complexity of recursive functions","volume":"4","author":"Blum","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(85)80032-2_bib3","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. Control"},{"key":"10.1016\/S0019-9958(85)80032-2_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 \u2212 NPA with probability 1","volume":"10","author":"Bennett","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(85)80032-2_bib5","series-title":"Proc. 14th ACM Sympos. Theory of Comput.","first-page":"310","article-title":"Isomorphism of Graphs with bounded eigenvalue multiplicity","author":"Babai","year":"1982"},{"key":"10.1016\/S0019-9958(85)80032-2_bib6","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(85)80032-2_bib7","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0019-9958(85)80032-2_bib8","series-title":"10th MFCS","first-page":"339","article-title":"Relationships between probabilistic and determinstic tape complexity","volume":"Vol. 118","author":"Jung","year":"1981"},{"key":"10.1016\/S0019-9958(85)80032-2_bib9","article-title":"On the Monte Carlo space-constructible functions and separation results for probabilistic complexity classes","author":"Karpinski","year":"1984"},{"key":"10.1016\/S0019-9958(85)80032-2_bib10","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(85)80032-2_bib11","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0304-3975(80)90053-5","article-title":"Halting space bounded computations","volume":"10","author":"Sipser","year":"1980","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995885800322?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995885800322?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T19:55:38Z","timestamp":1548532538000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995885800322"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["S0019995885800322"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(85)80032-2","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}