Primality testing in polynomial time
| Permalink: | http://skupnikatalog.nsk.hr/Record/fer.KOHA-OAI-FER:34841/Similar |
|---|---|
| Glavni autor: | Dietzfelbinger, Martin (-) |
| Vrsta građe: | Knjiga |
| Jezik: | eng |
| Impresum: |
Berlin ; New York :
Springer,
c2004.
|
| Izdanje: | 1st ed |
| Nakladnička cjelina: |
Lecture notes in computer science. Tutorial.
Lecture notes in computer science ; 3000. |
| Predmet: | |
| Online pristup: |
Contributor biographical information Publisher description |
APA stil citiranja
Dietzfelbinger, M. (2004). Primality testing in polynomial time: Primality testing in polynomial time : from randomized algorithms to "primes" is in P. Berlin ; New York: Springer.
Chicago stil citiranjaDietzfelbinger, Martin. Primality testing in polynomial time: Primality testing in polynomial time : from randomized algorithms to "primes" is in P. Berlin ; New York: Springer, 2004.
MLA stil citiranjaDietzfelbinger, Martin. Primality testing in polynomial time: Primality testing in polynomial time : from randomized algorithms to "primes" is in P. Berlin ; New York: Springer, 2004.