The set of minimal braids is co-NP-complete

DOI10.1016/0196-6774(91)90011-MzbMath0726.68047OpenAlexW2017133739MaRDI QIDQ3348424

No author found.

Publication date: 1991

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(91)90011-m

zbMATH Keywords

braid groupminimal braids

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (11)

Strong law of large numbers on graphs and groups ⋮ Finite-time braiding exponents ⋮ A fast method for comparing braids ⋮ Mean-set attack: cryptanalysis of Sibert et al. authentication protocol ⋮ A NOTE ON CLOSED 3-BRAIDS ⋮ Attack on Kayawood protocol: uncloaking private keys ⋮ Efficient solutions to the braid isotopy problem. ⋮ A new approach to the word and conjugacy problems in the braid groups ⋮ Logspace computations in graph products ⋮ An attack on the Walnut digital signature algorithm ⋮ The word problem for Artin groups of FC type

This page was built for publication: The set of minimal braids is co-NP-complete