NP-easy
NP-easy adjective: solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP.
Adjective
NP-easy (not comparable)
- Solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP.
Questions about NP-easy
- What does NP-easy mean?
- NP-easy means solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP.
- What part of speech is NP-easy?
- NP-easy is an adjective.
Words near NP-easy in the dictionary
Source and license
Adapted from Wiktionary: NP-easy (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “NP-easy.” Word.ws, https://word.ws/np-easy. Based on Wiktionary, CC BY-SA 4.0.
