Complexity theory : exploring the limits of efficient algorithms
By: Wegener, Ingo.
Contributor(s): Pruim, Randall, Tr.
Material type:
BookPublisher: Berlin Springer 2010Description: xi, 308p.ISBN: 9783540210450.Subject(s): AlorithmsDDC classification: 518.1 | W421cE
| Item type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
Books
|
PK Kelkar Library, IIT Kanpur | General Stacks | 518.1 W421cE (Browse shelf) | Available | A173484 |
Total holds: 0
Browsing PK Kelkar Library, IIT Kanpur Shelves , Collection code: General Stacks Close shelf browser
| 518.1 M698P PROBABILITY AND COMPUTING | 518.1 N553I INVITATION TO FIXED-PARAMETER ALGORITHMS | 518.1 V549r The random projection method | 518.1 W421cE Complexity theory | 518.2 F264m Meshfree approximation methods with MATLAB | 518.2 P943 Progress on meshless methods | 518.24 D565f FEFLOW |
Translated From The German,, Komplexitatstheorie -- Grenzen Der Effizienz Von Algorithmen "(Springer -- Verlag 2003, Isbn 3-540-00161-1).
There are no comments for this item.