Define the complexity classes P and NP, providing formal definitions and concrete examples of problems that fall into each category. Discuss the concept of polynomial-time reduction and NP-completeness. Explain why the question of whether P equals NP is significant for fields such as cryptography, algorithm design, and operations research.