Image from Amazon.com
LECTURE NOTES IN COMPUTER SCIENCE (V.3000) : PRIMALITY TESTING IN POLYNOMIAL TIME : From randomized algorithms to "PRIMES is in P"
Material type:
TextLanguage: English Series: Lecture Notes in computer sciencePublication details: Springer-Verlag 2004 BerlinDescription: x, 147pISBN: - 3540403442
- 001.64 L497
| Item type | Current library | 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(Opens below)) | Link to resource | Available | A150621 |
Total holds: 0
Browsing PK Kelkar Library, IIT Kanpur shelves, Collection: COMPACT STORAGE (BASEMENT) Close shelf browser (Hides shelf browser)
|
|
No cover image available |
|
|
|
|
||
| 001.64 L497 REWRITING TECHNIQUES AND APPLICATIONS | 001.64 L497 L497 LECTURE NOTES IN COMPUTER SCIENCE | 001.64 L497 V. 276 Lecture notes in computer science [V.276] ECOOP'87 (European Conference on Object-Oriented Programming) | 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 [V.233] Mathematical foundations of Computer Science 1986 |
There are no comments on this title.
Log in to your account to post a comment.