Skip to main content
SpringerLink
Log in

The parallel complexity of some constructions in combinatorial group theory (abstract)

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1990 (MFCS 1990)

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

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. Avenhaus, K. Madlener, Subrekursive Komplexität bei Gruppen, I. Gruppen mit vorgeschriebener Komplexität, Acta Informatica 9 (1977) 87–104.

    Google Scholar 

  2. J. Avenhaus, K. Madlener, Subrekursive Komplexität bei Gruppen, II. Der Einbettungssatz von Higman für entscheidbare Gruppen. Acta Informatica 9 (1978) 183–193.

    Google Scholar 

  3. J. Avenhaus, K. Madlener, The Nielson reduction and P-complete problems in free groups, Theoret. Comput. Sci. 32 (1984) 61–76.

    Google Scholar 

  4. J. Avenhaus, K. Madlener, On the complexity of intersection and conjugacy problems in free groups, Theoret. Comput. Sci. 32 (1984) 279–295.

    Google Scholar 

  5. M. Krause, S. Waack, On oblivious branching programs of linear length, in: Proc. FCT'89 Szeged, Lecture Notes in Computer Science 380 (Springer-Verlag, Berlin, 1989) 287–296.

    Google Scholar 

  6. K. Kriegel, S. Waack, Lower bounds on the complexity of real-time branching programs, Informatique theorique et Applications/Theoretical Informatics and Applications 22 (4) 447–459 (1988).

    Google Scholar 

  7. R.J. Lipton, Y. Zalcstein, Word problems solvable in logspace, Journal of the ACM, 24 (3) (1977) 322–526.

    Google Scholar 

  8. H. Neumann, Varieties of groups, Ergebnisse der Mathematik und Grenzgebiete Band 37, Springer-Verlag 1967.

    Google Scholar 

  9. H.U. Simon, Word problems for groups and contextfree recognition, in: Proc. FCT'79, Akademie-Verlag, Berlin 1979.

    Google Scholar 

  10. C. Tretkoff, Complexity, combinatorial group theory and the language of pulatators, Theoret. Comput. Sci. 56 (1988) 253–275.

    Google Scholar 

  11. S. Waack, Tape complexity of word problems, in: Proc. FCT'81, Lecture Notes in Computer Science 117 (Springer-Verlag, Berlin, 1981) 467–471.

    Google Scholar 

  12. S. Waack, Tape complexity of word problems, TR IMATH der AdW der DDR, Berlin 1981.

    Google Scholar 

  13. S. Waack, Raumkomplexität von Wortproblemen endlicher Gruppenpräsentationen, Dissertation A, Berlin 1983.

    Google Scholar 

  14. S. Waack, On the parallel complexity of linear groups, submitted to publication.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Karl-Weierstraß-Institut für Mathematik Akademie der Wissenschaften der DDR, Postfach 1304, 1086, Berlin, DDR

    Stephan Waack

Authors
  1. Stephan Waack
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Waack, S. (1990). The parallel complexity of some constructions in combinatorial group theory (abstract). In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029647

Download citation

  • DOI: https://doi.org/10.1007/BFb0029647

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52953-8

  • Online ISBN: 978-3-540-47185-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation