Computing distances in braid-move graphs, higher Bruhat orders, and oriented-matroid mutation graphs is NP-hard

arXiv:2610.03808 · cs.DM, math.CO · Submitted 2026-10-01 · Read on arXiv