Theory of Computation Complexity. Du ,Ding-Zhu.
Series: Wiley Interscience Series in Discrete Mathematics and OptimizationPublication details: New York. John Wiley & Sons. 2000Description: xiii,491 pISBN:- 0471345067
- QA 267.7.D 8 2000 9322
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|
Books
|
University of Embu | QA 267.7.D 8 2000 (Browse shelf(Opens below)) | Available | 12297 | ||||
|
Books
|
University of Embu General Stacks | Non-fiction | QA 267.7.D 8 2000 (Browse shelf(Opens below)) | Available | 9322 | |||
|
Books
|
University of Embu General Stacks | Non-fiction | QA 267.7.D 8 2000 (Browse shelf(Opens below)) | Available | 9323 | |||
|
Books
|
University of Embu General Stacks | Non-fiction | QA 267.7.D 8 2000 (Browse shelf(Opens below)) | Available | 9324 | |||
|
Books
|
University of Embu General Stacks | Non-fiction | QA 267.7.D 8 2000 (Browse shelf(Opens below)) | Available | 9325 |
Total holds: 0
Browsing University of Embu shelves, Shelving location: General Stacks, Collection: Non-fiction Close shelf browser (Hides shelf browser)
| No cover image available | No cover image available | |||||||
| QA 154.3.S763 2008 College Algebra. | QA 154.3.S763 2008 College Algebra. | QA184.2.C37 2007 Linear Algebra From The Beginning. | QA 267.7.D 8 2000 Theory of Computation Complexity. | QA 267.7.D 8 2000 Theory of Computation Complexity. | QA 267.7.D 8 2000 Theory of Computation Complexity. | QA 267.7.D 8 2000 Theory of Computation Complexity. |
Includes index.
There are no comments on this title.
Log in to your account to post a comment.