Make Entry -- Become an Editor -- Most Popular: (10, 25, 50, 75, 100)

   Help

Algorithmic Complexity

Algorithmic complexity measures the computational resources needed to solve computational problems. Computational resources are measured in terms of either time (i.e., number of elementary computational steps per second) or space (i.e., size of memory, usually measured in bits or bytes) or some combination of the two. If computational devices had unlimited memory and could perform calculations instantaneously, algorithmic complexity would be a nonissue. All real-world computers, however, have limited memory and perform calculations at fixed rates. The more time and space are required to run an algorithm, the greater its algorithmic complexity.

Book Resources On Algorithmic Complexity

Introduction to Algorithms by Thomas H. Cormen
Introduction to the Design and Analysis of Algorithms by Anany V. Levitin
An Introduction to Genetic Algorithms by Melanie Mitchell

Editor(s): William A. Dembski

Site Maps: Most Recent | Clusters | Browse
New: Graduate Student Job Opportunity