Np-easy

adj

adj ·Rare ·Advanced level

Definitions

Adjective
  1. 1
    Solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP. not-comparable

Data sourced from Wiktionary, WordNet, CMU, and other open linguistic databases. Updated March 2026.