A new parallel vector model, with exact characterization of NCk

  • Kenneth W. Regan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 775)


This paper develops a new and natural parallel vector model, and shows that for all k≥1, the languages recognizable in O(logkn) time and polynomial work in the model are exactly those in NCk. Some improvements to other simulations in parallel models and reversal complexity are given.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity Theory. Springer Verlag, 1988.Google Scholar
  2. [2]
    D. Mix Barrington. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comp. Sys. Sci., 38:150–164, 1989.Google Scholar
  3. [3]
    D. Mix Barrington, K. Compton, H. Straubing, and D. Thérien. Regular languages in NC1. J. Comp. Sys. Sci., 44:478–499, 1992.Google Scholar
  4. [4]
    D. Mix Barrington, N. Immerman, and H. Straubing. On uniformity within NC1. J. Comp. Sys. Sci., 41:274–306, 1990.Google Scholar
  5. [5]
    D. Mix Barrington and D. Thérien. Finite monoids and the fine structure of NC1. J. ACM, 35:941–952, 1988.Google Scholar
  6. [6]
    A. Chandra, S. Fortune, and R. Lipton. Unbounded fan-in circuits and associative functions. J. Comp. Sys. Sci., 30:222–234, 1985.Google Scholar
  7. [7]
    J. Chen and C. Yap. Reversal complexity. SIAM J. Comp., 20:622–638, 1991.Google Scholar
  8. [8]
    S. Cook. A taxonomy of problems with fast parallel algorithms. Info. Control, 64:2–22, 1985.Google Scholar
  9. [9]
    T. Harju, H.C.M. Klein, and M. Latteux. Deterministic sequential functions. Acta Informatics, 29:545–554, 1992.Google Scholar
  10. [10]
    J. Hartmanis, N. Immerman, and S. Mahaney. One-way log tape reductions. In Proc. 19th FOCS, pages 65–72, 1978.Google Scholar
  11. [11]
    J.-W. Hong. Computation: Similarity and Duality. Research Notes in Theoretical Computer Science. Wiley, 1986.Google Scholar
  12. [12]
    J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 1979.Google Scholar
  13. [13]
    T. Kameda and R. Vollmar. Note on tape reversal complexity of languages. Info. Control, 17:203–215, 1970.Google Scholar
  14. [14]
    R. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 871–941. Elsevier and MIT Press, 1990.Google Scholar
  15. [15]
    P. McKenzie, P. Péladeau, and D. Thérien. NC1: The automata-theoretic viewpoint. Computational Complexity, 1:330–359, 1991.Google Scholar
  16. [16]
    I. Parberry. An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits. Inf. Proc. Lett., 24:363–367, 1987.Google Scholar
  17. [17]
    W. Paul, E. Prauss, and R. Reischuk. On alternation. Acta Informatica, 14:243–255, 1980.Google Scholar
  18. [18]
    N. Pippenger. On simultaneous resource bounds. In Proc. 20th FOCS, pages 307–311, 1979.Google Scholar
  19. [19]
    V. Pratt and L. Stockmeyer. A characterization of the power of vector machines. J. Comp. Sys. Sci., 12:198–221, 1976.Google Scholar
  20. [20]
    W. Ruzzo. On uniform circuit complexity. J. Comp. Sys. Sci., 22:365–373, 1981.Google Scholar
  21. [21]
    J. Simon. On some central problems in computational complexity. PhD thesis, Cornell University, 1975.Google Scholar
  22. [22]
    M. Sipser. Borel sets and circuit complexity. In Proc. 15th STOC, pages 61–69, 1983.Google Scholar
  23. [23]
    L. Stockmeyer and U. Vishkin. Simulations of parallel random access machines by circuits. SIAM J. Comp., 13:409–422, 1984.Google Scholar
  24. [24]
    J. Trahan, M. Loui, and V. Ramachandran. Multiplication, division, and shift instructions in parallel random access machines. Theor. Comp. Sci., 100:1–44, 1992.Google Scholar
  25. [25]
    P. van Emde Boas. Machine models and simulations. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 1–66. Elsevier and MIT Press, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Kenneth W. Regan
    • 1
  1. 1.State University of New York at BuffaloUSA

Personalised recommendations