最終更新日：2024/08/03
(computing theory) solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP
正解を見る
NP-easy
編集履歴（0）
(computing theory) solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP
NP-easy
DiQt（ディクト）
無料
★★★★★★★★★★
