Computational complexity


Computational complexity is a study on Complexity that works on Classification of computational problems according to their inherent difficulty, and relating these classes to each other.

A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm.

More Information#

There might be more information for this subject on one of the following: