Practical Computational Complexity.

Abstract

Computational Complexity Analysis is a very powerful tool for use in designing algorithms. Unfortunately, the analysis can sometimes be misleading for the range of input with which the algorithm will actually be used. The aim of this paper is to first give an overview of what computational complexity is, and how to analyse it, and to then explain what parts of complexity analysis can cause confusion, and how to avoid these mistakes. The paper also seeks to investigate ways of solving problems faster by sacrificing certain operating requirements.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1991
Accession Number
ADA240670

Entities

People

  • D. E. Symonds

Organizations

  • Royal Signals and Radar Establishment

Tags

Communities of Interest

  • C4I
  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Accuracy
  • Algorithms
  • Annealing
  • Computational Complexity
  • Computer Science
  • Computers
  • Decomposition
  • Errors
  • Exponential Functions
  • Guarantees
  • Inversion
  • Iterations
  • Notation
  • Operating Systems
  • Polynomials
  • Simulations

Fields of Study

  • Computer science

Readers

  • Operations Research
  • Systems Analysis and Design