Cup length as a bound on topological complexity

Parth Sarin

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…