arXiv · 1710.06502
Cup length as a bound on topological complexity
Abstract
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$.
Explore related subjects
Keep this discovery
Parth Sarin. 2017-10-17. Cup length as a bound on topological complexity. https://arxiv.org/abs/1710.06502
Cite the original work for its findings. Save a collection to share your selection of sources.