具有 运行 复杂度且包含无理指数的算法
Algorithm's that has the run complexity which contains irrational exponents
你好我想知道是否有任何算法具有 运行 的复杂性，其中包含一个无理指数。 Strassen 的矩阵乘法算法是我正在寻找的东西，但还有更多吗？
带有一些示例的小列表：
- 计算数论中的一些算法的复杂度用L-notation, and some of them feature irrational exponents: Lenstra's elliptic-curve factorization, Dixon's factorization, Index calculus algorithm表示。
- Stooge Sort 的复杂度是指数
log(3)/log(3/2)，它是一个无理数。
- Toom-Cook multiplication.
- 据称，all SAT solvers feature其复杂性的非理性指数
- The following list
但更一般地说，应该可以挖掘（甚至监控）wikipedia's list of algorithms , parse and extract the mathematical expression associated with time complexity, and possibly feed the list of expressions into a CAS (for example SymPy using a convertor like latex2sympy) capable of figuring out if there are any irrational exponents involved (wikidata could be a better option if it had complete structured data coverage, example: wikidata's quicksort page). It would also be possible to extend this data collection past Wikipedia, into arXiv which apparently offers latex sources 某些文章，然后使用乳胶解析器和表达式解析器来查找这些类型的复杂性。
你好我想知道是否有任何算法具有 运行 的复杂性，其中包含一个无理指数。 Strassen 的矩阵乘法算法是我正在寻找的东西，但还有更多吗？
带有一些示例的小列表：
- 计算数论中的一些算法的复杂度用L-notation, and some of them feature irrational exponents: Lenstra's elliptic-curve factorization, Dixon's factorization, Index calculus algorithm表示。
- Stooge Sort 的复杂度是指数
log(3)/log(3/2)，它是一个无理数。 - Toom-Cook multiplication.
- 据称，all SAT solvers feature其复杂性的非理性指数
- The following list
但更一般地说，应该可以挖掘（甚至监控）wikipedia's list of algorithms , parse and extract the mathematical expression associated with time complexity, and possibly feed the list of expressions into a CAS (for example SymPy using a convertor like latex2sympy) capable of figuring out if there are any irrational exponents involved (wikidata could be a better option if it had complete structured data coverage, example: wikidata's quicksort page). It would also be possible to extend this data collection past Wikipedia, into arXiv which apparently offers latex sources 某些文章，然后使用乳胶解析器和表达式解析器来查找这些类型的复杂性。