Strict Lower and Upper Bounds on Iterative Computational Complexity.

Abstract

A non-asymptotic theory of iterative computational complexity was constructed with strict lower and upper bounds. In order to make the complexity ideas as accessible as possible the authors have limited themselves to scalar non-linear problems.

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1975
Accession Number
ADA020207

Entities

People

  • H. Wozniakowski
  • Joseph F. Traub

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Computational Complexity

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Linear Algebra