Feasible computations and provable complexity properties
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
Item type | Current library | Call number | Materials specified | Copy number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|---|
![]() |
Central Library | 004.01511352 HAR(FEA) (Browse shelf(Opens below)) | 1 | Available | 6701 |
Total holds: 0
Browsing Central Library shelves Close shelf browser (Hides shelf browser)
![]() |
![]() |
No cover image available | No cover image available | No cover image available |
![]() |
![]() |
||
004.01511352 GOL(COM) Computational complexity: a conceptual perspective | 004.01511352 GOL(COM) Computational complexity: a conceptual perspective | 004.01511352 HAR(FEA) Feasible computations and provable complexity properties | 004.01511352 HAR(FEA) Feasible computations and provable complexity properties | 004.01511352 HAR(FEA) Feasible computations and provable complexity properties | 004.01511352 HOM(COM) Computability and Complexity Theory | 004.01511352 JON(COM) Computability and complexity: from a programming perspective |
SAR/20/2009/11-05-09
There are no comments on this title.