A polynomial-time solution to the reducibility problem
英文摘要：
We propose an algorithm for deciding whether a given braid is pseudo-Anosov, reducible, or periodic. The algorithm is based on Garside's weighted decomposition and is polynomial-time in the word-length of an input braid. Moreover, a reduction system of circles can be found completely if the input is a certain type of reducible braids.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
