NP-easy
adj1
Computing, Computing theory, Engineering, Mathematics, Natural sciences, Physical sciences, Sciences Solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP.
adj
Computing, Computing theory, Engineering, Mathematics, Natural sciences, Physical sciences, Sciences Solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP.
Entry derived from the Wiktionary, under licence CC BY-SA 4.0 — list of authors.
Do you accept non-essential analytics cookies?