Real Computations with Fake Numbers

Authors:
Felipe Cucker
Affiliations:
-
Venue:
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Year:
1999

Citing 19
Cited 2

A note on a theorem of Blum, Shub, and Smale

Journal of Complexity
Some remarks on the foundations of numerical analysis

SIAM Review
Average-case stability of Gaussian elimination

SIAM Journal on Matrix Analysis and Applications
On the computational complexity and geometry of the first-order theory of the reals. Par I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals

Journal of Symbolic Computation
PR≠NCR

Journal of Complexity
Complexity of Bezout's theorem III: condition number and packing

Journal of Complexity - Festschrift for Joseph F. Traub, Part 1
Complexity of Bezout's theorem V: polynomial time

Selected papers of the workshop on Continuous algorithms and complexity
Some perturbation theory for linear programming

Mathematical Programming: Series A and B
Linear programming, complexity theory and elementary functional analysis

Mathematical Programming: Series A and B
On the combinatorial and algebraic complexity of quantifier elimination

Journal of the ACM (JACM)
Complexity of Bezout's theorem IV: probability of success; extensions

SIAM Journal on Numerical Analysis
Applied numerical linear algebra

Applied numerical linear algebra
Complexity and real computation

Complexity and real computation
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Complexity estimates depending on condition and round-off error

Journal of the ACM (JACM)
The real dimension problem is NPR -complete

Journal of Complexity
Accuracy and Stability of Numerical Algorithms

Accuracy and Stability of Numerical Algorithms
Rounding Errors in Algebraic Processes

Rounding Errors in Algebraic Processes
Algebraic Complexity Theory

Algebraic Complexity Theory

Learning from Approximate Data

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Learning Real Polynomials with a Turing Machine

ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

During the last few years a theory of computation over the real numbers developed with the aim of laying theoretical foundations for the kind of computations performed in numerical analysis. In this paper we describe the notions playing major roles in this theory -- with special emphasis on those which do not appear in discrete complexity theory -- and review some of its results.