Computational complexity is a branch of computer science that studies the resources required for algorithms to solve problems, focusing on time and space as primary metrics. It categorizes problems based on their inherent difficulty and the efficiency of the best possible algorithms that solve them, providing a framework for understanding what can be computed feasibly.