Theory of Optimal Algorithms,

Abstract

Motivations for studying computational complexity are discussed. Some recent results in algebraic and analytic computational complexity are surveyed. This report is based on an invited paper presented at a Conference on Software for Numerical Mathematics held at Loughborough, England. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1973
Accession Number
AD0764101

Entities

People

  • Joseph F. Traub

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computational Complexity
  • Computations
  • Mathematics
  • Motivation

Fields of Study

  • Computer science

Readers

  • Academic Conference Management
  • Computational Fluid Dynamics (CFD)
  • Systems Analysis and Design