Real computations with fake numbers
From MaRDI portal
Publication:1599196
DOI10.1006/jcom.2001.0607zbMath1004.68069WikidataQ57733268 ScholiaQ57733268MaRDI QIDQ1599196
Publication date: 16 February 2003
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.2001.0607
68Q25: Analysis of algorithms and problem complexity
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
Related Items
Some remarks on the condition number of a real random square matrix, Alan Turing and the Foundations of Computable Analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Turing machines that take advice
- A note on a theorem of Blum, Shub, and Smale
- The complexity of logical theories
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
- Numerical stability for solving nonlinear equations
- Towards a formal definition of numerical stability
- Some perturbation theory for linear programming
- Separation of complexity classes in Koiran's weak model
- Complexity of Bezout's theorem. V: Polynomial time
- The real number model in numerical analysis
- Computing over the reals with addition and order: Higher complexity classes
- Linear programming, complexity theory and elementary functional analysis
- The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete.
- Complexity of Bezout's theorem. III: Condition number and packing
- On the Complexity of Quantifier Elimination: the Structural Approach
- Complexity estimates depending on condition and round-off error
- Some Remarks on the Foundations of Numerical Analysis
- Average-Case Stability of Gaussian Elimination
- Eigenvalues and Condition Numbers of Random Matrices
- The fundamental theorem of algebra and complexity theory
- Complexity of Bezout's Theorem I: Geometric Aspects
- Computational Complexity and Numerical Stability
- Logics which capture complexity classes over the reals
- On the Power of Real Turing Machines over Binary Inputs
- Solving a Polynomial Equation: Some History and Recent Progress
- On the combinatorial and algebraic complexity of quantifier elimination
- Sur la complexité du principe de Tarski-Seidenberg
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Modern Error Analysis
- Numerical inverting of matrices of high order
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
