Computational complexity refers to how complex a given problem is to solve using computational methods. In computer science, it refers to the analysis of algorithms to determine the amount of resources – such as time and storage – necessary to execute them.