多项式时间中的排序括号
Ranking Bracelets in Polynomial Time
摘要：
本文的主要结果是第一个多项式时间算法的手镯排名。算法的时间复杂度是O（k^2 n^4），其中k是字母表的大小，n是所考虑的手镯的长度。该算法的关键部分是通过找到其他三个等级来计算任何单词相对于手镯集合的等级：所有项链的等级，回文项链的等级，以及封闭的回文项链的等级。本文介绍了后两个概念。这些等级是我们算法的关键组成部分，以便将问题分解为多个部分。此外，这个排名过程被用来建立一个多项式时间unranking算法。
英文摘要：
The main result of the paper is the first polynomial-time algorithm for ranking bracelets. The time-complexity of the algorithm is O(k^2 n^4), where k is the size of the alphabet and n is the length of the considered bracelets. The key part of the algorithm is to compute the rank of any word with respect to the set of bracelets by finding three other ranks: the rank over all necklaces, the rank over palindromic necklaces, and the rank over enclosing apalindromic necklaces. The last two concepts are introduced in this paper. These ranks are key components to our algorithm in order to decompose the problem into parts. Additionally, this ranking procedure is used to build a polynomial-time unranking algorithm.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
