Computational complexity theory - Wikipedia, the free encyclopedia

Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. A

en.wikipedia.org