Primality testing in polynomial time from randomized algorithms to "Primes is in P"
| Κύριος συγγραφέας: | Dietzfelbinger, Martin |
|---|---|
| Μορφή: | Βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
Berlin
Springer
2004
|
| Σειρά: | Lecture notes in computer science
3000 |
| Θέματα: |
Παρόμοια τεκμήρια
-
Primality Testing in Polynomial Time From Randomized Algorithms to "PRIMES Is in P" /
ανά: Dietzfelbinger, Martin
Έκδοση: (2004) -
Computer algebra Systems and algorithms for algebraic computation
ανά: Davenport, J. H.
Έκδοση: (1988) -
Mathematics for computer science
ανά: Arnold, Andre
Έκδοση: (1996) -
Mathematica 4.0 standard add-on packages the official guide to over a thousand additional functions for use with Mathematica 4
Έκδοση: (1999) -
Discrete mathematics /
ανά: Ross, Kenneth A.
Έκδοση: (1985)