1. Computational Complexity of Iterative Processes
- Author
-
Joseph F. Traub
- Subjects
Average-case complexity ,Mathematical optimization ,Theoretical computer science ,General Computer Science ,Computer science ,General Mathematics ,Complete ,Computational resource ,Computational complexity ,PH ,Dynamic problem ,Iterative methods (Mathematics) ,FOS: Mathematics ,Asymptotic computational complexity ,Computational problem ,Mathematics ,Quantum complexity theory - Abstract
The theory of optimal algorithmic processes is part of computational complexity. This paper deals with analytic computational complexity. The relation between the goodness of an iteration algorithm and its new function evaluation and memory requirements are analyzed. A new conjecture is stated.
- Published
- 1972