Computational complexity theory: Difference between revisions

Content deleted Content added

Inline

Revision as of 20:25, 6 November 2006

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.

This short article can be made longer. You can help Wikipedia by adding to it.

@@ Line 1: / Line 1: @@
-'''Computational complexity theory''' is a part of [[computer science]]. It looks at [[algorithm]]s, 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.
+'''Computational complexity theory''' is a part of [[computer science]]. It looks at [[algorithm]]s, and tries to say how many steps or how much memory a certain algorithm takes for a computer to do. Very often,  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.
 {{Stub}}
 [[Category:Computer science]]