On the topology of algorithms. I
From MaRDI portal
Publication:1099953
DOI10.1016/0885-064X(87)90021-5zbMath0639.68042OpenAlexW2055359591MaRDI QIDQ1099953
Publication date: 1987
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0885-064x(87)90021-5
algorithmscovering numbertopological complexityfractional cascadingrange searchcomputation treesbranching nodescohomology ring of braid group
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)
Related Items
Topological complexity of zero finding with algebraic operations, Topological volumes of fibrations: a note on open covers, The genus and the category of configuration spaces, The polynomial topological complexity of Fatou-Julia sets, Norms of roots of trinomials, Lower bounds for arithmetic networks. II: Sum of Betti numbers, On topological invariants of real algebraic functions, Braid group cohomologies and algorithm complexity, A lower bound for the topological complexity of poly(D,n), Topological complexity and real roots of polynomials, Equivariant topological complexity, Configuration-like spaces and coincidences of maps on orbits, Thom spectra of the commutator subgroups of the generalized braid groups, Topology of arrangements and representation stability. Abstracts from the workshop held January 14--20, 2018, Topological complexity of the range searching, Complexity of linear problems with a fixed output basis, A few problems on monodromy and discriminants, Topology and Motion Planning Algorithms in Robotics, Finding a vector orthogonal to roughly half a collection of vectors, Rational topological complexity, Combinatorics for computing relativistic several complex variable domains, Joins of DGA modules and sectional category, On higher analogs of topological complexity, Topological complexity of a root finding algorithm, Lower bounds for arithmetic networks, Visualizing Local Minima in Multi-robot Motion Planning Using Multilevel Morse Theory, A refined model of computation for continuous problems, On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines, Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision, Why does information-based complexity use the real number model?, Complexity lower bounds for approximation algebraic computation trees
Cites Work
