Complexity estimates depending on condition and round-off error-Reference-Cited by-同舟云学术

Complexity estimates depending on condition and round-off error

Published:1999-01 Issue:1 Volume:46 Page:113-184
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Cucker Felipe¹,Smale Steve¹

Affiliation:

1. City Univ. of Hong Kong, Kowloon, Hong Kong

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/300515.300519

Reference33 articles.

1. ALLGOWER E. AND GEORG K. 1990. Numerical Continuation Methods. Springer-Verlag New York.]] ALLGOWER E. AND GEORG K. 1990. Numerical Continuation Methods. Springer-Verlag New York.]]

2. BLUM L. CUCKER F. SHUB M. AND SHALE S. 1998. Complexity and Real Computation. Springer-Verlag New York.]] BLUM L. CUCKER F. SHUB M. AND SHALE S. 1998. Complexity and Real Computation. Springer-Verlag New York.]]

3. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines;BLUM L.;Bull, AMS,1989

Cited by 41 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Which neural networks can be computed by an algorithm? – Generalised hardness of approximation meets Deep Learning;PAMM;2023-03

2. New data structure for univariate polynomial approximation and applications to root isolation, numerical multipoint evaluation, and other problems;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

3. Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing;Synthese;2020-05-04

4. A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations;Journal of the ACM;2019-08-31

5. Computing the Homology of Semialgebraic Sets. I: Lax Formulas;Foundations of Computational Mathematics;2019-05-06