Cup length as a bound on topological complexity
Cup length as a bound on topological complexity
复制标题
杯长度作为拓扑复杂性的界限
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Parth Sarin
中科院分区：
文献类型：
--
作者：
Parth Sarin
多项式求解算法在应用数学和科学中是必不可少的。因此，降低它们的复杂性已经成为拓扑研究的一个非常重要的领域。我们提出了一种构造多项式求解算法复杂度下界的拓扑方法，并给出了在$ mathm {deg}(f) = 2,3,4$的情况下的具体算法。
Polynomial solving algorithms are essential to applied mathematics and the sciences. As such, reduction of their complexity has become an incredibly important field of topological research. We present a topological approach to constructing a lower bound for the complexity of a polynomial-solving algorithm, and give a concrete algorithm to do this in the case that $mathrm{deg}(f) = 2,3,4$.