{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T18:18:29Z","timestamp":1770488309052,"version":"3.49.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T00:00:00Z","timestamp":1497484800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"NWO","award":["617.023.116"],"award-info":[{"award-number":["617.023.116"]}]},{"name":"NWO gravitation program networks"},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["616787"],"award-info":[{"award-number":["616787"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Neuron Fund for Support of Science"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s00224-017-9784-7","type":"journal-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T01:56:16Z","timestamp":1497491776000},"page":"116-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Catalytic Space: Non-determinism and Hierarchy"],"prefix":"10.1007","volume":"62","author":[{"given":"Harry","family":"Buhrman","sequence":"first","affiliation":[]},{"given":"Michal","family":"Kouck\u00fd","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7562-457X","authenticated-orcid":false,"given":"Bruno","family":"Loff","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Speelman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,15]]},"reference":[{"issue":"6","key":"9784_CR1","doi-asserted-by":"crossref","first-page":"1467","DOI":"10.1137\/050628994","volume":"35","author":"E Allender","year":"2006","unstructured":"Allender, E., Buhrman, H., Kouck\u00fd, M., van Melkebeek, D., Ronneburger, D.: Power from random strings. SIAM J. Comput. 35(6), 1467\u20131493 (2006)","journal-title":"SIAM J. Comput."},{"key":"9784_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational complexity: A modern approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational complexity: A modern approach. Cambridge University Press, Cambridge (2009)"},{"key":"9784_CR3","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Cleve, R., Kouck\u00fd, M., Loff, B., Speelman, F.: Computing with a full memory: Computing with a full Catalytic space. In: Proceedings of the 46th STOC, pp. 857\u2013866 (2014)","DOI":"10.1145\/2591796.2591874"},{"issue":"5","key":"9784_CR4","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","volume":"17","author":"N Immerman","year":"1988","unstructured":"Immerman, N.: Nondeterministic space is closed under complementation. SIAM J. Comput. 17(5), 935\u2013938 (1988)","journal-title":"SIAM J. Comput."},{"key":"9784_CR5","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Paturi, R.: The complexity of k-sat. In: Proceedings of the 14th CCC, pp. 237\u2013240 (1999)","DOI":"10.1109\/CCC.1999.766282"},{"key":"9784_CR6","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In: Proceedings of the 29th STOC, pp. 220\u2013229 (1997)","DOI":"10.1145\/258533.258590"},{"key":"9784_CR7","first-page":"191","volume":"28","author":"R Karp","year":"1982","unstructured":"Karp, R., Lipton, R.: Turing machines that take advice. L\u2019Enseignement Math. 28, 191\u2013209 (1982)","journal-title":"L\u2019Enseignement Math."},{"issue":"3","key":"9784_CR8","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s00037-009-0277-1","volume":"19","author":"J Kinne","year":"2010","unstructured":"Kinne, J., Van Melkebeek, D.: Space hierarchy results for randomized and other semantic models. Comput. Complex. 19(3), 423\u2013475 (2010)","journal-title":"Comput. Complex."},{"issue":"5","key":"9784_CR9","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1137\/S0097539700389652","volume":"31","author":"A Klivans","year":"2002","unstructured":"Klivans, A., Van Melkebeek, D.: Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM J. Comput. 31(5), 1501\u20131526 (2002)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9784_CR10","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","volume":"26","author":"R Szelepcs\u00e9nyi","year":"1988","unstructured":"Szelepcs\u00e9nyi, R.: The method of forced enumeration for nondeterministic automata. Acta Inform. 26(3), 279\u2013284 (1988)","journal-title":"Acta Inform."},{"issue":"2","key":"9784_CR11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s00037-007-0227-8","volume":"16","author":"D Van Melkebeek","year":"2007","unstructured":"Van Melkebeek, D., Pervyshev, K.: A generic time hierarchy with one bit of advice. Comput. Complex. 16(2), 139\u2013179 (2007)","journal-title":"Comput. Complex."},{"issue":"3","key":"9784_CR12","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0304-3975(83)90015-4","volume":"26","author":"S \u017d\u00e1k","year":"1983","unstructured":"\u017d\u00e1k, S.: A Turing machine time hierarchy. Theor. Comput. Sci. 26(3), 327\u2013333 (1983)","journal-title":"Theor. Comput. Sci."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-017-9784-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9784-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9784-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,5]],"date-time":"2018-01-05T01:44:35Z","timestamp":1515116675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-017-9784-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,15]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["9784"],"URL":"https:\/\/doi.org\/10.1007\/s00224-017-9784-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,15]]}}}