Stability versus speed in a computable algebraic model
DOI10.1016/J.TCS.2005.09.053zbMATH Open1086.68043OpenAlexW2038225053MaRDI QIDQ817853FDOQ817853
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
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms in real algebraic geometry
- Combinatorial complexity bounds for arrangements of curves and spheres
- Title not available (Why is that?)
- On Computable Numbers, with an Application to the Entscheidungsproblem
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
- Multidimensional Searching Problems
- On the definitions of computable real continuous functions
- Title not available (Why is that?)
- Cutting hyperplanes for divide-and-conquer
- Feasible real random access machines
- Computability on Regular Subsets of Euclidean Space
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms
- Title not available (Why is that?)
- Exponential lower bounds for some NP-complete problems in a restricted linear decision tree model
- Topological complexity of zero finding with algebraic operations
- Symbolic treatment of geometric degeneracies
Cited In (3)
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)
