Abstract
We extend results of [P,P,S,T] and show that for time-constructible f, \(\sum _4 (f) \supsetneqq \Delta _0\)(f)=DTIME(f). Using limited nondeterminism, we define a "weak" hierarchy Σ wn (f), a refinement of the alternation hierarchy Σn(f) which satisfies ∪n∑n(f)=∪n∑ wn (f); we show that the Σ wn (f) hierarchy does not collapse.
Research partially supported by NSF grant MCS-81-02854
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
A. Chandra, D. Kozen and L. Stockmeyer, Alternation, J. ACM, 28 (1981 114–133
P. Fischer and C. Kintala, Refining non-determinism in relativized polynomial-time bounded computations, SIAM J. Comput., vol. 9, No. 1, 46–53 (1980)
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)
K. McAloon, Hierarchy results for MIXED-TIME, Brooklyn College Computer Science Technical Report No. 11
W. Paul, N. Pippenger, E. Szemeredi and W. Trotter, On determinism versus non-determinism and related problems, FOCS 1983
W. Paul and R. Reishuk, On Alternation, II, Acta Informatica, 14 (1980) 391–403
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McAloon, K. (1986). Separation results for bounded alternation. In: Selman, A.L. (eds) Structure in Complexity Theory. Lecture Notes in Computer Science, vol 223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16486-3_104
Download citation
DOI: https://doi.org/10.1007/3-540-16486-3_104
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16486-9
Online ISBN: 978-3-540-39825-7
eBook Packages: Springer Book Archive