Stability versus speed in a computable algebraic model

DOI10.1016/J.TCS.2005.09.053MaRDI QIDQ817853zbMATH OpenOpenAlexFDO

Authors 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

stabilitypoint locationspeedrecursive analysismodels of computationlinear decision tree

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Applications of computability and recursion theory (03D80) Abstract and axiomatic computability and recursion theory (03D75) Constructive and recursive analysis (03F60)

Recommendations

• On speed versus accuracy: Some case studies
• A topological view on algebraic computation models
• Publication:3201738
• scientific article; zbMATH DE number 4078610
• Complexity of computation on real algebraic numbers

Cites work

• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 42384 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• scientific article; zbMATH DE number 1033560 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1746051 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• scientific article; zbMATH DE number 3326329 (Why is no real title available?)
• Algorithms in real algebraic geometry
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms
• Combinatorial complexity bounds for arrangements of curves and spheres
• Computability on Regular Subsets of Euclidean Space
• Cutting hyperplanes for divide-and-conquer
• Exponential lower bounds for some NP-complete problems in a restricted linear decision tree model
• Feasible real random access machines
• Multidimensional Searching Problems
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On the definitions of computable real continuous functions
• ROUNDING-OFF ERRORS IN MATRIX PROCESSES
• Symbolic treatment of geometric degeneracies
• Topological complexity of zero finding with algebraic operations

Cited in

(3)

• scientific article; zbMATH DE number 1302875 (Why is no real title available?)
• Algebraic stuttering simulations
• scientific article; zbMATH DE number 6292628 (Why is no real title available?)

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

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