The nielsen reduction as key problem to polynomial algorithms in free groups

  • J. Avenhaus
  • K. Madlener
2. Algebraic Structures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 144)


Free Group Polynomial Time Word Problem Polynomial Time Algorithm Computable Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AM1]
    Avenhaus, J., Madlener, K.: Subrekursive Komplexität bei Gruppen. I. Gruppen mit vorgeschriebener Komplexität Acta Inf. 9, 87–104 (1977)Google Scholar
  2. [AM2]
    Avenhaus, J., Madlener, K.: P-complete problems in free groups. 5 GI Conference in Theor. Comp. Sci. Karlsruhe 1981Google Scholar
  3. [LS]
    Lyndon, R.C., Schupp, P.E.: Combinatorial group theory, Berlin, 1977Google Scholar
  4. [LZ]
    Lipton, R.J., Zalcstein, Y.: Word problems solvable in log space. JACM 24, 522–526 (1977)CrossRefGoogle Scholar
  5. [MKS]
    Magnus, W., Karrass, A., Solitar, D.: Combinatorial group theory, New York, 1966Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • J. Avenhaus
    • 1
  • K. Madlener
    • 1
  1. 1.Fachbereich InformatikUniversität KaiserslauternGermany

Personalised recommendations