P, NP, and NP-completeness : the basics of computational complexity Oded Goldreich.
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
- 9780521192484 (hardback)
- 9780521122542 (pbk.)
- 005.1 22 GOL-P
Item type | Current library | Call number | Copy number | Status | Date due | Barcode |
---|---|---|---|---|---|---|
![]() |
IISER Central Library Second Floor- Left Wing | 005.1 GOL-P (Browse shelf(Opens below)) | 1 | Available | 0005008 |
Browsing IISER Central Library shelves, Shelving location: Second Floor- Left Wing Close shelf browser (Hides shelf browser)
No cover image available No cover image available |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
005.1 DOE-H copy-2 The Haskell road to logic,maths and programming | 005.1 DRO-H How to solve it by computer | 005.1 DRO-H How to solve it by computer | 005.1 GOL-P P, NP, and NP-completeness : | 005.1 JAL-C A Concise Introduction To Software Engeneering | 005.1 KLE-A Algorithm design | 005.1 KLE-A Algorithm design |
Includes bibliographical references and index.
There are no comments on this title.