Skip to main content
SpringerLink
Log in

A new parallel vector model, with exact characterization of NCk

  • Conference paper
  • First Online:
STACS 94 (STACS 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 775))

Included in the following conference series:

Abstract

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.

The author was supported in part by NSF Research Initiation Award CCR-9011248

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity Theory. Springer Verlag, 1988.

    Google Scholar 

  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. 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. D. Mix Barrington, N. Immerman, and H. Straubing. On uniformity within NC1. J. Comp. Sys. Sci., 41:274–306, 1990.

    Google Scholar 

  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. 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. J. Chen and C. Yap. Reversal complexity. SIAM J. Comp., 20:622–638, 1991.

    Google Scholar 

  8. S. Cook. A taxonomy of problems with fast parallel algorithms. Info. Control, 64:2–22, 1985.

    Google Scholar 

  9. T. Harju, H.C.M. Klein, and M. Latteux. Deterministic sequential functions. Acta Informatics, 29:545–554, 1992.

    Google Scholar 

  10. J. Hartmanis, N. Immerman, and S. Mahaney. One-way log tape reductions. In Proc. 19th FOCS, pages 65–72, 1978.

    Google Scholar 

  11. J.-W. Hong. Computation: Similarity and Duality. Research Notes in Theoretical Computer Science. Wiley, 1986.

    Google Scholar 

  12. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 1979.

    Google Scholar 

  13. T. Kameda and R. Vollmar. Note on tape reversal complexity of languages. Info. Control, 17:203–215, 1970.

    Google Scholar 

  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. P. McKenzie, P. Péladeau, and D. Thérien. NC1: The automata-theoretic viewpoint. Computational Complexity, 1:330–359, 1991.

    Google Scholar 

  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. W. Paul, E. Prauss, and R. Reischuk. On alternation. Acta Informatica, 14:243–255, 1980.

    Google Scholar 

  18. N. Pippenger. On simultaneous resource bounds. In Proc. 20th FOCS, pages 307–311, 1979.

    Google Scholar 

  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. W. Ruzzo. On uniform circuit complexity. J. Comp. Sys. Sci., 22:365–373, 1981.

    Google Scholar 

  21. J. Simon. On some central problems in computational complexity. PhD thesis, Cornell University, 1975.

    Google Scholar 

  22. M. Sipser. Borel sets and circuit complexity. In Proc. 15th STOC, pages 61–69, 1983.

    Google Scholar 

  23. L. Stockmeyer and U. Vishkin. Simulations of parallel random access machines by circuits. SIAM J. Comp., 13:409–422, 1984.

    Google Scholar 

  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. 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 

Download references

Author information

Author notes

  1. Kenneth W. Regan

    Present address: Computer Science Department, 226 Bell Hall, UB North Campus, 14260-2000, Buffalo, NY

Authors and Affiliations

  1. State University of New York at Buffalo, USA

    Kenneth W. Regan

Authors
  1. Kenneth W. Regan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Patrice Enjalbert Ernst W. Mayr Klaus W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Regan, K.W. (1994). A new parallel vector model, with exact characterization of NCk . In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57785-8_149

Download citation

  • DOI: https://doi.org/10.1007/3-540-57785-8_149

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57785-0

  • Online ISBN: 978-3-540-48332-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation