Computational-complexity meaning

kŏmpyo͝o-tāshə-nəl
The quantification of the difficulty of a computational problem in terms of the computer resources (such as computational time or amount of memory) required for its solution.
noun
0
0
A mathematical characterization of the difficulty of a mathematical problem which describes the resources required by a computing machine to solve the problem. The mathematical study of such characterizations is called computational complexity theory and is important in many branches of theoretical computer science, especially cryptography.
0
0
Advertisement