Provide a comprehensive theoretical overview of the P vs NP problem. Define P (Polynomial time) and NP (Nondeterministic Polynomial time) in the context of computational complexity. Discuss the implications if P were equal to NP versus if they are not equal. Finally, explain the concept of NP-Completeness and its role in this theoretical landscape without using specific code.