FAST NIELSEN-THURSTON CLASSIFICATION OF BRAIDS

We prove the existence of an algorithm which solves the reducibility problem in braid groups and runs in quadratic time with respect to the braid length for any fixed braid index.

Data and Resources

Additional Info

Field Value
Source https://hal.science/hal-00647035
Author Calvez, Matthieu
Maintainer CCSD
Last Updated May 9, 2026, 06:40 (UTC)
Created May 9, 2026, 06:40 (UTC)
Identifier hal-00647035
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Departamento de Matematicas
creator Calvez, Matthieu
date 2013-09-09T00:00:00
harvest_object_id 0d46359f-da0e-46aa-b14c-1172210c5a1b
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2024-03-14T00:00:00
relation info:eu-repo/semantics/altIdentifier/arxiv/1112.0165
set_spec type:UNDEFINED