Skip to main content
Book Chapter

Computer aided discovery of a fast algorithm for testing conjugacy in braid groups

  • Gebhardt V
Springer Berlin Heidelberg, (2007), 261-285
DOI: 10.1007/978-3-540-37634-7_12
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Gebhardt, V. (2007). Computer aided discovery of a fast algorithm for testing conjugacy in braid groups. In Discovering Mathematics with Magma (pp. 261–285). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-37634-7_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free