Real computations with fake numbers
type: Item
instance of: scholarly article
title: Real computations with fake numbers
zbMATH Open document ID: 1004.68069
author: Felipe Cucker
published in: Journal of Complexity
publication date: 2003-02-16T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q30
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1750219
zbMATH Keywords: numerical analysis under complete information
describes a project that uses: mctoolbox
Wikidata QID: Q57733268
MaRDI profile type: Publication
full work available at URL: jcom.2001.0607
OpenAlex ID: W1992313960
cites work: On the combinatorial and algebraic complexity of quantifier elimination
cites work: The complexity of logical theories
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
cites work: On the Complexity of Quantifier Elimination: the Structural Approach
cites work: On the Power of Real Turing Machines over Binary Inputs
cites work: Q4234080
cites work: Computing over the reals with addition and order: Higher complexity classes
cites work: Logics which capture complexity classes over the reals
cites work: Separation of complexity classes in Koiran's weak model
cites work: Complexity estimates depending on condition and round-off error
cites work: Towards a formal definition of numerical stability
cites work: Q4348513
cites work: Eigenvalues and Condition Numbers of Random Matrices
cites work: Q4186267
cites work: Q4234078
cites work: Sur la complexité du principe de Tarski-Seidenberg
cites work: Q4864704
cites work: Q3802475
cites work: Turing machines that take advice
cites work: Q3935355
cites work: Q4002474
cites work: Q4864428
cites work: Q4231918
cites work: The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete.
cites work: Computational Complexity and Numerical Stability
cites work: The real number model in numerical analysis
cites work: Q5829318
cites work: Solving a Polynomial Equation: Some History and Recent Progress
cites work: Q1185456
cites work: Some perturbation theory for linear programming
cites work: Incorporating Condition Measures into the Complexity Theory of Linear Programming
cites work: Linear programming, complexity theory and elementary functional analysis
cites work: Complexity of Bezout's Theorem I: Geometric Aspects
cites work: Q3135179
cites work: Complexity of Bezout's theorem. III: Condition number and packing
cites work: Complexity of Bezout's theorem. V: Polynomial time
cites work: Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
cites work: The fundamental theorem of algebra and complexity theory
cites work: Some Remarks on the Foundations of Numerical Analysis
cites work: Q4356579
cites work: Q4040428
cites work: Q4226567
cites work: Q4337625
cites work: Average-Case Stability of Gaussian Elimination
cites work: A note on a theorem of Blum, Shub, and Smale
cites work: ROUNDING-OFF ERRORS IN MATRIX PROCESSES
cites work: Numerical inverting of matrices of high order
cites work: Q4485693
cites work: Q4342463
cites work: Modern Error Analysis
cites work: Numerical stability for solving nonlinear equations
cites work: Q4717973
DBLP publication ID: journals/jc/Cucker02
DOI: 10.1006/JCOM.2001.0607
Recommended article: Q4938618
Recommended article: Computations with effective real numbers
Recommended article: Real numbers and computers
Recommended article: Q3184782
Recommended article: A faithful computational model of the real numbers
Recommended article: Computability of Real Numbers
Recommended article: Lazy computation with exact real numbers

Real computations with fake numbers (Recommended article)
Recommended article: Real number computations: On the use of information
Similarity Score: 0.828098
Recommender Run: Recommender Run 2

Real computations with fake numbers (Recommended article)
Recommended article: Q4281917
Similarity Score: 0.8271731
Recommender Run: Recommender Run 2