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

DOI10.1016/0885-064X(89)90011-3MaRDI QIDQ1123617zbMATH OpenFDO

Authors Harold I. Levine

Publication date 1989

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

Full work available at URL https://doi.org/10.1016/0885-064X(89)90011-3

zbMATH Keywords

branching nodescomputation nodescomputation treestopological complexity

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4213455
• Topological complexity and real roots of polynomials
• Topological complexity of a root finding algorithm
• On the topology of algorithms. I
• scientific article; zbMATH DE number 503392

Cites work

• Cohomologies of the group COS mod 2
• scientific article; zbMATH DE number 3235051 (Why is no real title available?)
• scientific article; zbMATH DE number 3356925 (Why is no real title available?)
• scientific article; zbMATH DE number 3055967 (Why is no real title available?)
• On Algorithms for Solvingf(x)=0
• On the topology of algorithms. I

Cited in

(6)

• On the topology of algorithms. I
• Topological complexity of the range searching
• scientific article; zbMATH DE number 4213455 (Why is no real title available?)
• scientific article; zbMATH DE number 4078810 (Why is no real title available?)
• scientific article; zbMATH DE number 503392 (Why is no real title available?)
• scientific article; zbMATH DE number 528937 (Why is no real title available?)

This page was built for publication: A lower bound for the topological complexity of poly(D,n)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123617)