Provide an in-depth analysis of the P vs NP problem, explaining what it means, its significance to computer science and mathematics, and the current state of research. Discuss the implications of both possible resolutions (P=NP or P≠NP) for cryptography, optimization problems, and other practical applications. Examine at least two major approaches researchers have taken to try to solve this problem, and discuss why it has proven so difficult to resolve.