Almost-everywhere complexity, bi-immunity and nondeterministic space

  • John G. Geske
  • Diane Kakihara
Theory Of Computing, Algorithms And Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 468)


We show that the complexity-theoretic notion of almost-everywhere complex functions is identical to the recursion-theoretic notion of bi-immune sets in the nondeterministic space domain. Furthermore we derive a very strong separation theorem for nondeterministic space — witnessing this fact by almost-everywhere complex sets — that is equivalent to the traditional infinitely-often complex hierarchy result. The almost-everywhere complex sets constructed here are the first such sets constructed for nondeterministic complexity classes.


Nondeterministic space complexity immune sets almost-everywhere complexity hierarchy theorems 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E. Allender, R. Beigel, U. Hertrampf, and S. Homer. A note on the almost-everywhere hierarchy for nondeterministic time. To appear in STACS 90, Lecture Notes in Computer Science.Google Scholar
  2. [2]
    J.L. Balcázar and U. Schöning. Bi-immune sets for complexity classes. Mathematical Systems Theory, 18(1):1–10, 1985.Google Scholar
  3. [3]
    L. Berman. On the structure of complete sets: almost everywhere complexity and infinitely often speedup. In Proc. 17th IEEE Symposium on the Foundations of Computer Science, volume 17, pages 76–80, 1976.Google Scholar
  4. [4]
    J.G. Geske. On the structure of intractable sets. PhD thesis, Iowa State University, 1987.Google Scholar
  5. [5]
    J.G. Geske, D. Huynh, and J. Seiferas. A technical note on bi-immunity and almost everywhere complexity. To appear in Information and Computation.Google Scholar
  6. [6]
    J.G. Geske, D. Huynh, and A. Selman. A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees. In STACS 87, Lecture Notes in Computer Science Vol. 247, pp. 125–135. Springer-Verlag, Berlin, 1987.Google Scholar
  7. [7]
    O.H. Ibarra. A note concerning nondeterministic tape complexities. Journal of the ACM, 19:608–612, 1972.Google Scholar
  8. [8]
    N. Immerman. Nondeterministic space is closed under complement. In Proc. Structure in Complexity Theory, volume 3, pages 112–115, 1988.Google Scholar
  9. [9]
    A.R. Meyer and E.M. McCreight. Computationally complex and pseudo-random zero-one valued functions. In Z. Kohavi and A. Paz, editors, Theory of Machines and Computations, pp. 19–42. Academic Press, New York, 1971.Google Scholar
  10. [10]
    M.O. Rabin. Degree of difficulty of computing a function and a partial ordering of recursive sets. Technical Report 2, Hebrew University, Jerusalem, Israel, 1960.Google Scholar
  11. [11]
    J.I. Seiferas, M.J. Fischer, and A.R. Meyer. Separating nondeterministic time complexity classes. Journal of the ACM, 25:146–167, 1978.Google Scholar
  12. [12]
    R. Szelepcesényi. The method of forcing for nondeterministic automata. Bull. European Association Theoretical Computer Science, pages 96–100, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • John G. Geske
    • 1
  • Diane Kakihara
    • 1
  1. 1.Department of Computer ScienceMichigan State UniversityEast Lansing

Personalised recommendations