Also known as: Np completeness
NP-полнота — понятие computational complexity theory для задач, которые одновременно находятся в NP и не легче любой другой задачи в NP. У таких задач solutions can be verified efficiently, but no known general method solves all instances efficiently.
In computational complexity theory, a problem is NP-complete when it can be solved by a restricted class of brute force search algorithms and it can be used to simulate any other problem with a similar algorithm. More precisely, each input to the problem should be associated with a set of solutions of polynomial length, whose validity can be tested quickly (in polynomial time), such that the output for any input is "yes" if the solution set is non-empty and "no" if it is empty.