Algebraic & Geometric Topology · 2012 · 14 citations · 9 references
Natural SciencesMathematicsGeometryTheory Of ComputationTopologyGeneral TopologyKnot TheoryComplexityUpper Bound ComputationUpper Bound Theorem
We give a new upper bound for Farber's topological complexity for rational spaces in terms of Sullivan models.We use it to determine the topological complexity in some new cases, and to prove a Ganea-type formula in these and other cases. 55M30, 55P62This is the sectional category (refer to Cornea, Lupton, Oprea and Tanr [1] and Schwarz [17]) of the path fibration.(Note that our definition differs from that of [2] by
9
Topological Complexity of Motion Planning
Michael Färber · Discrete & Computational Geometry · 2003 · 380 citations · Full text
On the topology of algorithms, I
Steve Smale · Journal of Complexity · 1987 · 152 citations
A proof of ganea's conjecture for rational spaces
Kathryn Hess · Topology · 1991 · 58 citations · Full text