Advertisement

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

  • Stephan Waack
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 452)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AM77]
    J. Avenhaus, K. Madlener, Subrekursive Komplexität bei Gruppen, I. Gruppen mit vorgeschriebener Komplexität, Acta Informatica 9 (1977) 87–104.Google Scholar
  2. [AM78]
    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. [AM84,1]
    J. Avenhaus, K. Madlener, The Nielson reduction and P-complete problems in free groups, Theoret. Comput. Sci. 32 (1984) 61–76.Google Scholar
  4. [AM84,2]
    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. [KW89]
    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. [KW88]
    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. [LZ77]
    R.J. Lipton, Y. Zalcstein, Word problems solvable in logspace, Journal of the ACM, 24 (3) (1977) 322–526.Google Scholar
  8. [Ne67]
    H. Neumann, Varieties of groups, Ergebnisse der Mathematik und Grenzgebiete Band 37, Springer-Verlag 1967.Google Scholar
  9. [Si79]
    H.U. Simon, Word problems for groups and contextfree recognition, in: Proc. FCT'79, Akademie-Verlag, Berlin 1979.Google Scholar
  10. [Tr88]
    C. Tretkoff, Complexity, combinatorial group theory and the language of pulatators, Theoret. Comput. Sci. 56 (1988) 253–275.Google Scholar
  11. [Wa81,1]
    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. [Wa81,2]
    S. Waack, Tape complexity of word problems, TR IMATH der AdW der DDR, Berlin 1981.Google Scholar
  13. [Wa83]
    S. Waack, Raumkomplexität von Wortproblemen endlicher Gruppenpräsentationen, Dissertation A, Berlin 1983.Google Scholar
  14. [Wa89]
    S. Waack, On the parallel complexity of linear groups, submitted to publication.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Stephan Waack
    • 1
  1. 1.Karl-Weierstraß-Institut für Mathematik Akademie der Wissenschaften der DDRBerlinDDR

Personalised recommendations