Image from Amazon.com
Image from OpenLibrary
Primality testing in polynomial time: from randomized algorithms to 'primes is in p'/ M. Dietzfelbinger.
Series: Texts in theoretical computer sciencePublication details: Berlin; London: Springer, 2003.Description: 110 pISBN:- 3540403442
- 9783540403449
- 512.72
| Item type | Current library | Collection | Call number | Copy number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
Books
|
Castorina Estantes Abertas (Open Shelves) | Coleções de Monografias (Monographs Collections) | 1 | Available | 39063000640253 |
There are no comments on this title.