NP-Easy Jesse Russell

ISBN: 9785512064245

Published: June 22nd 2012

Paperback

144 pages


Description

NP-Easy  by  Jesse Russell

NP-Easy by Jesse Russell
June 22nd 2012 | Paperback | PDF, EPUB, FB2, DjVu, audiobook, mp3, ZIP | 144 pages | ISBN: 9785512064245 | 6.75 Mb

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.



Enter the sum





Related Archive Books



Related Books


Comments

Comments for "NP-Easy":


keyboardmilitia.com

©2013-2015 | DMCA | Contact us