LECTURE NOTES IN COMPUTER SCIENCE (V.3000) : PRIMALITY TESTING IN POLYNOMIAL TIME : From randomized algorithms to "PRIMES is in P"
By: Dietzfelbinger, Martin.
Material type:
BookSeries: Lecture Notes in computer science.Publisher: Berlin Springer-Verlag 2004Description: x, 147p.ISBN: 3540403442.Subject(s): Computer ScienceDDC classification: 001.64 | L497 Online resources: Click here to access online
| Item type | Current location | Collection | Call number | url | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|---|
Books
|
PK Kelkar Library, IIT Kanpur | COMPACT STORAGE (BASEMENT) | 001.64 L497 v. 3000 (Browse shelf) | Book Request | Available | A150621 |
Total holds: 0
Browsing PK Kelkar Library, IIT Kanpur Shelves , Collection code: COMPACT STORAGE (BASEMENT) Close shelf browser
| 001.64 L497 Lecture notes in computer science | 001.64 L497 REWRITING TECHNIQUES AND APPLICATIONS | 001.64 L497 L497 LECTURE NOTES IN COMPUTER SCIENCE | 001.64 L497 v. 3000 LECTURE NOTES IN COMPUTER SCIENCE (V.3000) | 001.64 L497 V.187 LECTURE NOTES IN COMPUTER SCIENCE | 001.64 L497 V.219 Lecture notes in computer science | 001.64 L497 V.233 LECTURE NOTES IN COMPUTER SCIENCE |
There are no comments for this item.