Skip to main content

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

  • 2. Algebraic Structures
  • Conference paper
  • First Online:
Computer Algebra (EUROCAM 1982)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avenhaus, J., Madlener, K.: Subrekursive Komplexität bei Gruppen. I. Gruppen mit vorgeschriebener Komplexität Acta Inf. 9, 87–104 (1977)

    Google Scholar 

  2. Avenhaus, J., Madlener, K.: P-complete problems in free groups. 5 GI Conference in Theor. Comp. Sci. Karlsruhe 1981

    Google Scholar 

  3. Lyndon, R.C., Schupp, P.E.: Combinatorial group theory, Berlin, 1977

    Google Scholar 

  4. Lipton, R.J., Zalcstein, Y.: Word problems solvable in log space. JACM 24, 522–526 (1977)

    Article  Google Scholar 

  5. Magnus, W., Karrass, A., Solitar, D.: Combinatorial group theory, New York, 1966

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jacques Calmet

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Avenhaus, J., Madlener, K. (1982). The nielsen reduction as key problem to polynomial algorithms in free groups. In: Calmet, J. (eds) Computer Algebra. EUROCAM 1982. Lecture Notes in Computer Science, vol 144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11607-9_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-11607-9_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11607-3

  • Online ISBN: 978-3-540-39433-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics