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.

Anagrams

This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.