On the Complexity of Intersection and Conjugacy Problems in Free Groups - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Jürgen Avenhaus, Klaus Madlener. On the Complexity of Intersection and Conjugacy Problems in Free Groups. Theoretical Computer Science, 32:279-295, 1984.

@article{AvenhausM84a,
  title = {On the Complexity of Intersection and Conjugacy Problems in Free Groups},
  author = {Jürgen Avenhaus and Klaus Madlener},
  year = {1984},
  researchr = {https://researchr.org/publication/AvenhausM84a},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {32},
  pages = {279-295},
}

runs on WebDSL