Stability versus speed in a computable algebraic model

DOI10.1016/j.tcs.2005.09.053zbMath1086.68043OpenAlexW2038225053MaRDI QIDQ817853

Martin Ziegler

Publication date: 20 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.053

zbMATH Keywords

stabilityspeedrecursive analysispoint locationmodels of computationlinear decision tree

Mathematics Subject Classification ID

Cites Work

• Combinatorial complexity bounds for arrangements of curves and spheres
• Exponential lower bounds for some NP-complete problems in a restricted linear decision tree model
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms
• Cutting hyperplanes for divide-and-conquer
• Feasible real random access machines
• Topological complexity of zero finding with algebraic operations
• Symbolic treatment of geometric degeneracies
• On the definitions of computable real continuous functions
• Multidimensional Searching Problems
• Computability on Regular Subsets of Euclidean Space
• On Computable Numbers, with an Application to the Entscheidungsproblem
• ROUNDING-OFF ERRORS IN MATRIX PROCESSES
• Algorithms in real algebraic geometry
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stability versus speed in a computable algebraic model