Explain the P vs NP problem and its significance in theoretical computer science. Define major complexity classes (P, NP, NP-complete, PSPACE) and their relationships. Analyze the concept of polynomial-time reduction and its role in establishing NP-completeness. Discuss the implications if P were found to equal NP or if P were proven not to equal NP, considering both practical and theoretical consequences.