Provide a comprehensive overview of computational complexity theory. Explain the basic concepts such as time complexity, space complexity, and the relationship between different complexity classes like P, NP, NP-complete, and NP-hard. Discuss the significance of the P vs NP problem and its implications for computer science and mathematics. Include examples of problems that belong to each complexity class and explain the techniques used to analyze and classify problems.