|
|
Definition of NP-complete
1. Adjective. (computing theory) Describing the hardest problems that are in the class NP, and whose solutions can be verified in polynomial time. ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of NP-complete
| NORAD NORBA NORs NOS NOT NOTAM NOTAR NOT function NOT functions NOT operator | NOTs NOW NO synthase NOx NP NP-complete (current term) NP-completeness NP-hard NPA NPC | NPCA NPD NPF NPH insulin NPI NPK NPL NPN NPO NPOESS |
Other Resources:
