Jump to content

Computational complexity theory

From Simple English Wikipedia, the free encyclopedia
Revision as of 20:25, 6 November 2006 by 85.124.31.21 (talk)

Computational complexity theory is a part of computer science. It looks at algorithms, and tries to say how many steps or how much memory a certain algorithm takes for a computer to do. Very often, algorithm that use fewer steps use more memory (or the other way round: if you have less memory available, it takes more steps to do). Unfortunately many interesting algorithms take a number of steps that is dependent on the size of the problem.