A refined model of computation for continuous problems
From MaRDI portal
Publication:1265141
DOI10.1006/jcom.1997.0465zbMath0919.68119OpenAlexW2018494663MaRDI QIDQ1265141
Publication date: 23 August 1999
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1997.0465
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Information-based complexity: New questions for mathematicians
- Multiplication is the easiest nontrivial arithmetic function
- On the topology of algorithms. I
- Computing with infinite objects
- On the complexity of online computations of real functions
- The real number model in numerical analysis
- Recursive characterization of computable real-valued functions and relations
- Numerics of analytic functions and complexity
- Topological complexity with continuous operations
- Topological complexity of zero-finding
- An efficient algorithm for the complex roots problem
- Computable functionals
- On the definitions of computable real continuous functions
- Some Remarks on the Foundations of Numerical Analysis
- Fast Multiple-Precision Evaluation of Elementary Functions
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Computability in Analysis and Physics
