NP-easy

NP-easy

Jesse Russell Ronald Cohn

     

бумажная книга

Продать эту книгу

ISBN: 978-5-5120-6424-5

High Quality Content by WIKIPEDIA articles! In complexity theory, the complexity class NP-easy is the set of function problems that are solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP.

Каталог