Modern cryptography, probabilistic proofs and pseudo-randomness /
Material type:
TextSeries: Algorithms and Combinatorics ; 17Publication details: Berlin: Springer-Verlag, 1999Description: xv, 182p. Index. BiblDDC classification: - 518.1 G621.MC
| Item type | Current library | Call number | Status | Notes | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
Book
|
ISID | 518.1 G621.MC (Browse shelf(Opens below)) | Available | Ord num:12; Ord dt:1999-03-17 | DP23895 |
Browsing ISID shelves Close shelf browser (Hides shelf browser)
| No cover image available | No cover image available |
|
No cover image available |
|
|
No cover image available | ||
| 518.1 G229.CI Computers and intractability; a guide to the theory of NP-Completeness | 518.1 G259.MC Modern computer algebra | 518.1 G539.PM Practical mathematical cryptography / | 518.1 G621.MC Modern cryptography, probabilistic proofs and pseudo-randomness / | 518.1 G621.PN P, NP, and np-completeness | 518.1 G741.CM Concrete mathematics : a foundation for computer science / | 518.1 G874.IP Inverse problems; activities for undergraduates |
There are no comments on this title.
Log in to your account to post a comment.