{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:30Z","timestamp":1725456750950},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029642","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"457-463","source":"Crossref","is-referenced-by-count":0,"title":["ATIME(n) is closed under Counting"],"prefix":"10.1007","author":[{"given":"Marek","family":"Piotr\u00f3w","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","volume":"24","author":"M. Ajtai","year":"1983","unstructured":"M. Ajtai, \u03c3 1 1 formulas on finite structures, Annals of Pure and Applied'Logic 24(1983), 1\u201348.","journal-title":"Annals of Pure and Applied'Logic"},{"key":"51_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1112\/blms\/16.2.127","volume":"16","author":"R. O. Gandy","year":"1984","unstructured":"R. O. Gandy, Some relations between classes of low computational complexity, Bull. London Math. Soc. 16(1984), 127\u2013134.","journal-title":"Bull. London Math. Soc."},{"key":"51_CR3","unstructured":"A. Grzegorczyk, Some classes of recursive functions, Rozprawy Mat. 4(1953)."},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"L. A. Hemachandra, The strong exponential hierarchy collapses, Proc. 19th STOC (1987), 110\u2013122.","DOI":"10.1145\/28395.28408"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"N. Immerman, Nondeterministic space is closed under complement, TR 552 (1987), Yale University, Comp. Sci. Depart.","DOI":"10.1109\/SCT.1988.5270"},{"issue":"2","key":"51_CR6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1112\/jlms\/s2-36.2.193","volume":"36","author":"M. Kuty\u0142owski","year":"1987","unstructured":"M. Kuty\u0142owski, Small Grzegorczyk classes, J. Londom Math. Soc. (2) 36(1987), 193\u2013210.","journal-title":"J. Londom Math. Soc."},{"issue":"1","key":"51_CR7","first-page":"48","volume":"145","author":"Y. Ofman","year":"1962","unstructured":"Yu. Ofman, On the algorithmic complexity of discrete functions, Doklady Akademii Nauk SSSR 145:1(1962), 48\u201351. English translation in Soviet Phisics Doklady 7:7(1963), 589\u2013591.","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"J. Paris and A. Wilkie, Counting problems in bounded arithmetic, Springer Lecture Notes in Mathematics 1130, Methods in Mathematical Logic, Proc. Caracas(1983), 317\u2013340.","DOI":"10.1007\/BFb0075316"},{"key":"51_CR9","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00264255","volume":"14","author":"W.J. Paul","year":"1980","unstructured":"W.J. Paul, E.J. Prauss and R. Reischuk, On alternation, Acta Informatica 14(1980), 243\u2013255.","journal-title":"Acta Informatica"},{"key":"51_CR10","first-page":"91","volume":"294","author":"U. Sh\u00f6ning","year":"1988","unstructured":"U. Sh\u00f6ning and K. Wagner, Collapsing oracle hierarchies, census functions and logarithmically many queries, Proc STACS 88, LNCS 294(1988), 91\u201397.","journal-title":"Proc STACS"},{"key":"51_CR11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(86)90141-6","volume":"47","author":"K. Wagner","year":"1986","unstructured":"K. Wagner, Some observations on the connections between counting and recursion, Theoret. Comp. Sci. 47(1986), 131\u2013147.","journal-title":"Theoret. Comp. Sci."},{"key":"51_CR12","volume-title":"Computational complexity","author":"K. Wagner","year":"1986","unstructured":"K. Wagner and G. Wechsung, Computational complexity, VEB Deutscher Verlag der Wissenschaften, Berlin 1986."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029642","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:15:22Z","timestamp":1586592922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029642"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0029642","relation":{},"subject":[]}}