Provide a comprehensive explanation of the P vs NP problem in computer science. Define P, NP, NP-complete, and NP-hard complexity classes with examples of problems in each category. Discuss the significance of the P vs NP problem, including its practical implications for cryptography, optimization, and algorithm design. Explain at least three major approaches that researchers have taken toward resolving this problem.