{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:11:32Z","timestamp":1725455492748},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016278","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"518-526","source":"Crossref","is-referenced-by-count":6,"title":["Two characterizations of the logarithmic alternation hierarchy"],"prefix":"10.1007","author":[{"given":"Klaus-J\u00f6rn","family":"Lange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. Chandra","year":"1981","unstructured":"A. Chandra, D. Kozen, L. Stockmeyer: Alternation, J. Assoc. Comput. Mach. 28 (1981), 114\u2013133.","journal-title":"J. Assoc. Comput. Mach."},{"key":"49_CR2","unstructured":"P. Flajolet, J. Steyaert: Complexity of classes of languages and operators, IRIA Laboria, Rap. de Recherche No. 92, Nov. 1974."},{"key":"49_CR3","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"J. Hopcroft, J. Ullman: Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading Mass., 1979."},{"key":"49_CR4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01683260","volume":"10","author":"R. Ladner","year":"1976","unstructured":"R. Ladner, N. Lynch: Relativization of questions about log space computability, Math. Systems Theory 10 (1976), 19\u201332.","journal-title":"Math. Systems Theory"},{"key":"49_CR5","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","volume":"1","author":"R. Ladner","year":"1975","unstructured":"R. Ladner, N. Lynch, A. Selman: A comparison of polynomial time reducibilities, Theoret. Comput. Sci. 1 (1975), 103\u2013123.","journal-title":"Theoret. Comput. Sci."},{"key":"49_CR6","unstructured":"K.-J. Lange: Nichtdeterministische Reduktionen und Logarithmische Hierarchien, Habilitationsschrift, University of Hamburg, 1985, (in German)."},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"K.-J. Lange: Decomposition of nondeterministic reductions, to be published in the proceedings of ICALP 1986.","DOI":"10.1007\/3-540-16761-7_70"},{"key":"49_CR8","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/322033.322037","volume":"24","author":"N. Lynch","year":"1977","unstructured":"N. Lynch: Log space recognition and translation of parenthesis languages, J. Assoc. Compu. Mach. 24 (1977), 583\u2013590.","journal-title":"J. Assoc. Compu. Mach."},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"A. Meyer, L. Stockmeyer: The equivalence problem for regular expressions with squaring requires exponential space, Proc. of the 13th IEEE Symp. on Swi. and Aut. Theory 1972, 125\u2013129.","DOI":"10.1109\/SWAT.1972.29"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"L. Rosier, H.-C. Yen: Logspace hierarchies, polynomial time and the complexity of fairness problems concerning \u03c9-machines, Proc. of STACS 1986, Springer LNCS 210, 306\u2013320.","DOI":"10.1007\/3-540-16078-7_85"},{"key":"49_CR11","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0022-0000(84)90066-7","volume":"28","author":"W. Ruzzo","year":"1984","unstructured":"W. Ruzzo, J. Simon, M. Tompa: Space-bounded hierarchies and probabilistic computations, J. Comput. System Sci. 28 (1984), 216\u2013230.","journal-title":"J. Comput. System Sci."},{"key":"49_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L. Stockmeyer","year":"1976","unstructured":"L. Stockmeyer: The polynomial-time hierarchy, Theoret. Comput. Sci. 3 (1976), 1\u201322.","journal-title":"Theoret. Comput. Sci."},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"L. Stockmeyer, A. Meyer: Word problems requiring exponential time: preliminary report, Proc. of the 5th ACM Symp. on Theory of Comp., 1973, 1\u20139.","DOI":"10.1145\/800125.804029"},{"key":"49_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","volume":"3","author":"C. Wrathall","year":"1976","unstructured":"C. Wrathall: Complete sets and the polynomial hierarchy, Theoret. Comput. Sci. 3 (1976), 23\u201333.","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016278.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:35:58Z","timestamp":1607549758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0016278","relation":{},"subject":[]}}