A lower bound for the topological complexity of poly(D,n)

DOI10.1016/0885-064X(89)90011-3zbMath0677.68046MaRDI QIDQ1123617

Harold I. Levine

Publication date: 1989

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

topological complexitycomputation treesbranching nodescomputation nodes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Covering spaces and low-dimensional topology (57M10) Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects) (55M30) Products and intersections in homology and cohomology (55N45)

Cites Work

• On the topology of algorithms. I
• Cohomologies of the group COS mod 2
• On Algorithms for Solvingf(x)=0
• Unnamed Item
• Unnamed Item
• Unnamed Item