Explain the P vs NP problem in computational complexity theory. Discuss why this is considered one of the most important open problems in computer science and mathematics. Outline the significance of both possible resolutions (P=NP or P≠NP) and their potential implications for cryptography, optimization, and other fields.