Complexity estimates depending on condition and round-off error

Authors:
Felipe Cucker;Steve Smale
Affiliations:
City Univ. of Hong Kong, Kowloon, Hong Kong;City Univ. of Hong Kong, Kowloon, Hong Kong
Venue:
Journal of the ACM (JACM)
Year:
1999

Citing 12
Cited 14

Solving systems of polynomial inequalities in subexponential time

Journal of Symbolic Computation
Numerical continuation methods: an introduction

Numerical continuation methods: an introduction
Concrete mathematics: a foundation for computer science

Concrete mathematics: a foundation for computer science
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
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
Complexity of Bezout's theorem IV: probability of success; extensions

SIAM Journal on Numerical Analysis
Complexity and real computation

Complexity and real computation
Accuracy and Stability of Numerical Algorithms

Accuracy and Stability of Numerical Algorithms
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Ein Entscheidungsverfahren für die Theorie der reell- abgeschlossenen Körper

Komplexität von Entscheidungsproblemen, Ein Seminar
Rounding Errors in Algebraic Processes

Rounding Errors in Algebraic Processes

Analytic constraint solving and interval arithmetic

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Real computations with fake numbers

Journal of Complexity
CLIP: A CLP(Intervals) Dialect for Metalevel Constraint Solving

PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
Real Computations with Fake Numbers

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Limits of theory sequences over algebraically closed fields and applications

Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Generalized polar varieties: geometry and algorithms

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
A numerical algorithm for zero counting, I: Complexity and accuracy

Journal of Complexity
Condition number based complexity estimate for computing local extrema

Journal of Computational and Applied Mathematics
Optimization and NP_R-completeness of certain fewnomials

Proceedings of the 2009 conference on Symbolic numeric computation
Generalized polar varieties: geometry and algorithms

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Condition number based complexity estimate for solving polynomial systems

Journal of Computational and Applied Mathematics
Optimizing n-variate (n+k)-nomials for small k

Theoretical Computer Science
A family of key agreement mechanisms for mission critical communications for secure mobile ad hoc and wireless mesh internetworking

EURASIP Journal on Wireless Communications and Networking - Special issue on security and resilience for smart devices and applications
Faster p-adic feasibility for certain multivariate sparse polynomials

Journal of Symbolic Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper has two agendas. One is to develop the foundations of round-off in computation. The other is to describe an algorithm for deciding feasibility for polynomial systems of equations and inequalities together with its complexity analysis and its round-off properties. Each role reinforces the other.