# NP-easy

Jump to navigation
Jump to search

## English[edit]

### Adjective[edit]

**NP-easy** (*not comparable*)

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

Definition from Wiktionary, the free dictionary

Jump to navigation
Jump to search

**NP-easy** (*not comparable*)

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

Retrieved from "https://en.wiktionary.org/w/index.php?title=NP-easy&oldid=65518670"