Jump to content

Computational complexity theory

From Simple English Wikipedia, the free encyclopedia
Revision as of 12:33, 17 August 2006 by Eptalon (talk | changes) (Another stub.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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, alorithms 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.