Skip to main content
Conference ProceedingsOPEN ACCESS

An efficient implementation of braid groups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2248 144-156
DOI: 10.1007/3-540-45682-1_9
48Citations
Citations of this article
41Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We implement various computations in the braid groups via practically efficient and theoretically optimized algorithms whose pseudo-codes are provided. The performance of an actual implementation under various choices of parameters is listed.

Cite

CITATION STYLE

APA

Cha, J. C., Ko, K. H., Lee, S. J., Han, J. W., & Cheon, J. H. (2001). An efficient implementation of braid groups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2248, pp. 144–156). Springer Verlag. https://doi.org/10.1007/3-540-45682-1_9

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