Romanian NP-completitudine Cited by user Andrei Stroe on 25 May 2017 dreapta|miniatura|300x300px|[[Diagramă Euler pentru mulțimile de probleme P, NP, NP-complete, și NP-dure.
English NP-complete Cited by user Citation bot 1 on 13 Oct 2011 Although any given solution to an NP-complete problem can be verified quickly (in polynomial time), there is no known efficient way to locate a solution in the first…