Theory of computational complexity
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 DU(THE) (Browse shelf(Opens below)) | 1 | Available | 20384 |
Total holds: 0
Browsing Central Library shelves Close shelf browser (Hides shelf browser)
![]() |
No cover image available |
![]() |
![]() |
![]() |
![]() |
No cover image available | ||
004.01511352 BOO(COM) Computability and logic | 004.01511352 CRE(COM) Complexity classifications of Boolean constraint satisfaction problems | 004.01511352 DOW(PAR) Parameterized complexity | 004.01511352 DU(THE) Theory of computational complexity | 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 |
INV. SAR/67/2014; dt.08-09-2014
There are no comments on this title.