adj
Meaning 1
That is both NP (solvable in polynomial time by a non-deterministic Turing machine) and NP-hard (such that any (other) NP problem can be reduced to it in polynomial time).
Definition source: English Wiktionary via Wiktextract
Usage: not-comparable
Topics: computing, computing-theory, engineering, mathematics, natural-sciences, physical-sciences, sciences
No example sentence was provided for this meaning.
Meaning relationships
Synonyms: none provided
Antonyms: none provided