Academic Commons

Articles

Computational Complexity of Iterative Processes

Traub, Joseph F.

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.

Files

  • thumnail for Traub__computational_complexity_of_iterative_processes.pdf Traub__computational_complexity_of_iterative_processes.pdf application/pdf 1020 KB Download File

Also Published In

Title
SIAM Journal on Computing
DOI
https://doi.org/10.1137/0201012

More About This Work

Academic Units
Computer Science
Published Here
October 10, 2013
Academic Commons provides global access to research and scholarship produced at Columbia University, Barnard College, Teachers College, Union Theological Seminary and Jewish Theological Seminary. Academic Commons is managed by the Columbia University Libraries.