Feasible computations and provable complexity properties
Material type: TextPublication details: Socy.For Indl.& Appld.Maths.SIAM 1989 Description: 62Subject(s): Machine theory | Formal languages | Computational complexityItem type | Current library | Call number | Materials specified | Copy number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|---|
Books | Central Library | 004.01511352 HAR(FEA) (Browse shelf(Opens below)) | 1 | Available | 6380 |
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 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 | 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 |
MD/1/0027/2009-10/02-05-09
There are no comments on this title.