The set of minimal braids is co-NP-complete☆
References (8)
Theorie der Zöpfe
Abh. Math. Sem. Univ. Hamburg
(1925)Theory of braids
Ann. of Math.
(1947)- et al.
Computers and Intractability. A Guide to the Theory of NP-Completeness
(1979) The braid group and other groups
Quart. J. Math. Oxford Ser. (2)
(1969)The braid group and other groups
pyc. лep. MaTeMaTикa
(1970)
There are more references available in the full text version of this article.
Cited by (36)
Logspace computations in graph products
2016, Journal of Symbolic ComputationEfficient solutions to the braid isotopy problem
2008, Discrete Applied MathematicsBraids: A Survey
2005, Handbook of Knot TheoryA note on closed 3-braids
2008, Communications in Contemporary MathematicsRandom walks on three-strand braids and on related hyperbolic groups
2003, Journal of Physics A: Mathematical and GeneralIn search of minimal random braid configurations
2002, Journal of Physics A: Mathematical and General
- ☆
This work was carried out during a visit to Warwick University by the second author, supported by a Visiting Fellowship from the SERC of the UK. The first author was partially supported by a Senior Fellowship from the SERC and by the ESPRIT II BRA Programme of the EC under Contract 3075 (ALCOM).
Copyright © 1991 Published by Elsevier Inc.