Monte Carlo methods. Vol. 1: basics
Monte Carlo methods. Vol. 1: basics
Information-based complexity
Eigenvalues and condition numbers of random matrices
SIAM Journal on Matrix Analysis and Applications
A note on a theorem of Blum, Shub, and Smale
Journal of Complexity
Average-case stability of Gaussian elimination
SIAM Journal on Matrix Analysis and Applications
Complexity theory of real functions
Complexity theory of real functions
Journal of Complexity
Complexity of Bezout's theorem III: condition number and packing
Journal of Complexity - Festschrift for Joseph F. Traub, Part 1
Separation of complexity classes in Koiran's weak model
Selected papers of the workshop on Continuous algorithms and complexity
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
The real number model in numerical analysis
Journal of Complexity
Computing over the reals with addition and order: higher complexity classes
Journal of Complexity
Linear programming, complexity theory and elementary functional analysis
Mathematical Programming: Series A and B
Descriptive complexity theory over the real numbers
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On real Turing machines that toss coins
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
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
On the Power of Real Turing Machines over Binary Inputs
SIAM Journal on Computing
Applied numerical linear algebra
Applied numerical linear algebra
Complexity and real computation
Complexity and real computation
Complexity estimates depending on condition and round-off error
Journal of the ACM (JACM)
Complexity and information
The real dimension problem is NPR -complete
Journal of Complexity
Computable analysis: an introduction
Computable analysis: an introduction
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Approximating the volume of definable sets
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Rounding Errors in Algebraic Processes
Rounding Errors in Algebraic Processes
Some remarks on the condition number of a real random square matrix
Journal of Complexity
| Hi-index | 0.00 |
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 under complete information. 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.