Computational Complexity of Iterative Processes.

Abstract

The theory of optimal algorithmic processes is part of computational complexity. The 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. (Author)

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1971
Accession Number
AD0732034

Entities

People

  • Joseph F. Traub

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computational Complexity
  • Iterations
  • Mathematics
  • Test And Evaluation

Readers

  • Mathematical Modeling and Probability Theory.
  • Regression Analysis.