Primality testing in polynomial time
| Permalink: | http://skupni.nsk.hr/Record/fer.KOHA-OAI-FER:34841/Details |
|---|---|
| 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 |
| LEADER | 01408cam a22003374a 4500 | ||
|---|---|---|---|
| 005 | 20130713153419.0 | ||
| 008 | 040524s2004 gw b 001 0 eng | ||
| 010 | |a 2004107785 | ||
| 020 | |a 3540403442 (acidfree paper) | ||
| 040 | |a DLC |c DLC |d HR-ZaFER |b hrv |e ppiak | ||
| 042 | |a pcc | ||
| 050 | 0 | 0 | |a QA246 |b .D54 2004 |
| 082 | 0 | 0 | |a 512.9/42 |2 22 |
| 100 | 1 | |a Dietzfelbinger, Martin. | |
| 245 | 1 | 0 | |a Primality testing in polynomial time : |b from randomized algorithms to "primes" is in P / |c Martin Dietzfelbinger. |
| 250 | |a 1st ed. | ||
| 260 | |a Berlin ; |a New York : |b Springer, |c c2004. | ||
| 300 | |a x, 147 p. ; |c 24 cm. | ||
| 490 | 1 | |a LNCS, |x 0302-9743 ; |v 3000. |a Tutorial | |
| 504 | |a Includes bibliographical references (p. [143]-144) and index. | ||
| 650 | 0 | |a Polynomials. | |
| 650 | 0 | |a Numbers, Prime. | |
| 650 | 0 | |a Algorithms. | |
| 830 | 0 | |a Lecture notes in computer science. |p Tutorial. | |
| 830 | 0 | |a Lecture notes in computer science ; |v 3000. | |
| 856 | 4 | 2 | |3 Contributor biographical information |u http://www.loc.gov/catdir/enhancements/fy0817/2004107785-b.html |
| 856 | 4 | 2 | |3 Publisher description |u http://www.loc.gov/catdir/enhancements/fy0817/2004107785-d.html |
| 906 | |a 7 |b cbc |c orignew |d 2 |e epcn |f 20 |g y-gencatlg | ||
| 942 | |2 udc |c K | ||
| 955 | |a pc17 2004-05-24 |a pv12 2004-09-29 to ASCD |a ja00 marcadia 2004-10-05 |a jp00 2004-10-22 |c jp43 2004-10-29 to subj |a aa07 2004-12-09 | ||
| 999 | |c 34841 |d 34841 | ||