{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:46:04Z","timestamp":1787503564061,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540164869","type":"print"},{"value":"9783540398257","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16486-3_90","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:46:19Z","timestamp":1330177579000},"page":"66-76","source":"Crossref","is-referenced-by-count":7,"title":["Relativized alternation"],"prefix":"10.1007","author":[{"given":"Jonathan F.","family":"Buss","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0204037","volume":"4","author":"T. Baker","year":"1975","unstructured":"T. Baker, J. Gill, R. Solovay, \u201cRelativizations of the P=? NP question,\u201d SIAM J. Comput. 4 (1975) 431\u2013452.","journal-title":"SIAM J. Comput."},{"key":"6_CR2","unstructured":"J. F. Buss, \u201cRelativized Alternation and Space-Bounded Computation,\u201d Ph.D. thesis, Massachusetts Institute of Technology, to appear, 1986."},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. K. Chandra","year":"1981","unstructured":"A. K. Chandra, D. Kozen, L. J. Stockmeyer, \u201cAlternation,\u201d J. Assoc. Comput. Mach. 28 (1981) 114\u2013133.","journal-title":"J. Assoc. Comput. Mach."},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01683260","volume":"10","author":"R. Ladner","year":"1976","unstructured":"R. Ladner, N. Lynch, \u201cRelativization of Questions about Log-Space Reducibility,\u201d Math. Syst. Theory 10 (1976) 19\u201332.","journal-title":"Math. Syst. Theory"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(78)90003-8","volume":"6","author":"N. Lynch","year":"1978","unstructured":"N. Lynch, \u201cLog Space Machines with Multiple Oracle Tapes,\u201d Theor. Comput. Sci. 6 (1978) 25\u201339.","journal-title":"Theor. Comput. Sci."},{"key":"6_CR6","first-page":"573","volume":"154","author":"P. Orponen","year":"1983","unstructured":"P. Orponen, \u201cComplexity Classes of Alternating Machines with Oracles,\u201d Automata, Languages and Programming, Lect. N. Comput. Sci. 154 (1983) 573\u2013584.","journal-title":"Automata, Languages and Programming, Lect. N. Comput. Sci."},{"key":"6_CR7","first-page":"194","volume-title":"Proc. of the Winter School on Theor. Comput. Sci.","author":"P. Orponen","year":"1984","unstructured":"P. Orponen, \u201cGeneral Nonrelativizability Results for Parallel Models of Computation,\u201d Proc. of the Winter School on Theor. Comput. Sci., Lammi, Finland (1984) 194\u2013205."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"W. L. Ruzzo, J. Simon, M. Tompa, \u201cSpace-Bounded Hierarchies and Probabilistic Computation,\u201d Proc. Fourteenth Ann. ACM Symp. Theory Comput. (1982) 215\u2013223.","DOI":"10.1145\/800070.802194"},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W. J. Savitch","year":"1970","unstructured":"W. J. Savitch, \u201cRelationships between Nondeterministic and Deterministic Tape Complexities,\u201d J. Comput. Syst. Sci. 4 (1970) 177\u2013192.","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR10","unstructured":"I. Simon, \u201cOn Some Subrecursive Reducibilities,\u201d Ph.D. dissertation, Stanford University, Report STAN-CS-77-608 (1977)."},{"key":"6_CR11","unstructured":"C. B. Wilson, \u201cRelativized Circuit Size and Depth,\u201d Ph.D. thesis, University of Toronto, Technical Report 179\/85 (1985). See also C. B. Wilson, \u201cParallel Computation and the NC hierarchy relativized,\u201d these proceedings."}],"container-title":["Lecture Notes in Computer Science","Structure in Complexity Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16486-3_90.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T17:04:19Z","timestamp":1619543059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16486-3_90"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164869","9783540398257"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-16486-3_90","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986]]}}}