Separation results for bounded alternation

  • Ken McAloon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 223)


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 Σ n w (f), a refinement of the alternation hierarchy Σn(f) which satisfies ∪nn(f)=∪n n w (f); we show that the Σ n w (f) hierarchy does not collapse.


Turing Machine Input Tape Brooklyn College Binary Alphabet Weak Quantifier 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [C,K,S]
    A. Chandra, D. Kozen and L. Stockmeyer, Alternation, J. ACM, 28 (1981 114–133Google Scholar
  2. [F,K]
    P. Fischer and C. Kintala, Refining non-determinism in relativized polynomial-time bounded computations, SIAM J. Comput., vol. 9, No. 1, 46–53 (1980)Google Scholar
  3. [G,J]
    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)Google Scholar
  4. [Mc]
    K. McAloon, Hierarchy results for MIXED-TIME, Brooklyn College Computer Science Technical Report No. 11Google Scholar
  5. [P,P,S,T]
    W. Paul, N. Pippenger, E. Szemeredi and W. Trotter, On determinism versus non-determinism and related problems, FOCS 1983Google Scholar
  6. [P,R]
    W. Paul and R. Reishuk, On Alternation, II, Acta Informatica, 14 (1980) 391–403Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Ken McAloon
    • 1
  1. 1.Brooklyn College and the Graduate Center/CUNYUSA

Personalised recommendations