6 citations · 9 across the 3 of their papers we have counts for
3 papers
math.AT2008★ 1 cited
Topological complexity of configuration spaces
Michael Farber, Mark Grant
The topological complexity TC(X) is a homotopy invariant which reflects the complexity of the problem of constructing a motion planning algorithm in the space X, viewed as configur…
math.AT2007★ 2 cited
Topological complexity of motion planning and Massey products
Mark Grant
We employ Massey products to find sharper lower bounds for the Schwarz genus of a fibration than those previously known. In particular we give examples of non-formal spaces for…
math.AT2007★ 6 cited
Robot motion planning, weights of cohomology classes, and cohomology operations
Michael Farber, Mark Grant
The complexity of algorithms solving the motion planning problem is measured by a homotopy invariant TC(X) of the configuration space X of the system. Previously known lower bounds…