Definify.com

Definition 2024


NP-easy

NP-easy

English

Adjective

NP-easy (not comparable)

  1. (computing theory) solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP