Pregunta:
In computational complexity theory, a class of decision problems where any given solution to the decision problem can be _verified_ in polynomial time. But, there is no known efficient way to _locate_ the solutions.
Autor: Noteworthy WhaleRespuesta:
NP-Complete (NP-C)
0 / 5 (0 calificaciones)
1 answer(s) in total