Welcome to P K Kelkar Library, Online Public Access Catalogue (OPAC)

Normal view MARC view ISBD view

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: materialTypeLabelBookSeries: 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
    average rating: 0.0 (0 votes)
Item type Current location Collection Call number url Status Date due Barcode Item holds
Books Books PK Kelkar Library, IIT Kanpur
COMPACT STORAGE (BASEMENT) 001.64 L497 v. 3000 (Browse shelf) Book Request Available A150621
Total holds: 0

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha