{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:49:00Z","timestamp":1725662940744},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540164869"},{"type":"electronic","value":"9783540398257"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16486-3_104","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:46:02Z","timestamp":1330177562000},"page":"265-271","source":"Crossref","is-referenced-by-count":0,"title":["Separation results for bounded alternation"],"prefix":"10.1007","author":[{"given":"Ken","family":"McAloon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"20_CR1","first-page":"114","volume":"28","author":"A. Chandra","year":"1981","unstructured":"A. Chandra, D. Kozen and L. Stockmeyer, Alternation, J. ACM, 28 (1981 114\u2013133","journal-title":"Alternation, J. ACM"},{"issue":"1","key":"20_CR2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1137\/0209003","volume":"9","author":"P. Fischer","year":"1980","unstructured":"P. Fischer and C. Kintala, Refining non-determinism in relativized polynomial-time bounded computations, SIAM J. Comput., vol. 9, No. 1, 46\u201353 (1980)","journal-title":"SIAM J. Comput."},{"key":"20_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco (1979)"},{"key":"20_CR4","unstructured":"K. McAloon, Hierarchy results for MIXED-TIME, Brooklyn College Computer Science Technical Report No. 11"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"W. Paul, N. Pippenger, E. Szemeredi and W. Trotter, On determinism versus non-determinism and related problems, FOCS 1983","DOI":"10.1109\/SFCS.1983.39"},{"key":"20_CR6","first-page":"391","volume":"14","author":"W. Paul","year":"1980","unstructured":"W. Paul and R. Reishuk, On Alternation, II, Acta Informatica, 14 (1980) 391\u2013403","journal-title":"II, Acta Informatica"}],"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_104.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T17:04:17Z","timestamp":1619543057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16486-3_104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164869","9783540398257"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-16486-3_104","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}