Explain the fundamental concepts of computational complexity theory. Discuss the classes P, NP, NP-complete, and NP-hard. Elaborate on the P versus NP problem and its significance in computer science. Include analysis of time complexity, space complexity, and the relationship between different complexity classes. Discuss reduction techniques and how they are used to classify problems. Finally, provide examples of problems that fall into each complexity class.