P, NP, and NP-completeness: Basic of computational complexity by Goldreich Oded
Material type: BookPublication details: Cambridge Cambridge University Press 2010Description: xxix, 184pISBN:- 9780521122542
- 005.1 P10 (CSA)
Item type | Current library | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|
Book | Computer Science and Automation | 005.1 P10 (CSA) (Browse shelf(Opens below)) | Available | CP902 |
There are no comments on this title.