A Polinomio No Determinista (NP) problem is a class of problems in teoría de la complejidad computacional que se caracterizan por las siguientes dos propiedades clave:
- Verificación: Given a proposed solution to an NP problem, it can be verified quickly (in polynomial time) si esta solución es correcta.
- Dificultad de búsqueda: Finding a solution may not be possible in polynomial time; it may require an búsqueda exhaustiva de posibles soluciones.
In simpler terms, NP problems are those for which we can efficiently check the correctness of a solution, even though we may struggle to find that solution in the first place. A classic example is the Problema del Viajante, where finding the shortest possible route that visits a set of cities is computationally hard, but verifying a given route’s length is straightforward.
Los problemas NP son fundamentales en el campo de ciencias de la computación and have significant implications in various domains such as cryptography, optimization, and inteligencia artificial. Understanding whether NP problems can be solved in polynomial time (the famous P vs NP question) is one of the most important open questions in computer science. If it were proven that P = NP, it would mean that all problems whose solutions can be quickly verified could also be quickly solved. Conversely, proving that P ≠ NP would imply that there are inherent limits to what can be efficiently computed.