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.


  • 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

SIAM Journal on Computing

More About This Work

Academic Units
Computer Science
Published Here
October 10, 2013