Computational complexity theory, as a branch of the theory of computation in computer science, investigates the problems relate to the amounts of resources required for the execution of algorithms (e.g., execution time), and the inherent difficulty in providing efficient algorithms for specific computational problems.