Sold Out
Book Categories |
Computing zeta functions via p-adic cohomology | 1 | |
Using primitive subgroups to do more with fewer bits | 18 | |
Elliptic curves of large rank and small conductor | 42 | |
Binary GCD like algorithms for some complex quadratic rings | 57 | |
On the complexity of computing units in a number field | 72 | |
Implementing the arithmetic of C[subscript 3,4] curves | 87 | |
Pseudocubes and primality testing | 102 | |
Elliptic curves with a given number of points | 117 | |
Rational divisors in rational divisor classes | 132 | |
Conjectures about discriminants of Hecke algebras of prime level | 140 | |
Montgomery scalar multiplication for genus 2 curves | 153 | |
Improved Weil and Tate pairings for elliptic and hyperelliptic curves | 169 | |
Elliptic curves x[superscript 3] + y[superscript 3] = k of high rank | 184 | |
Proving the primality of very large numbers with fastECPP | 194 | |
A low-memory parallel version of Matsuo, Chao, and Tsujii's algorithm | 208 | |
Function field sieve in characteristic three | 223 | |
A comparison of CEILIDH and XTR | 235 | |
Stable models of elliptic curves, ring class fields, and complex multiplication | 250 | |
An algorithm for computing isomorphisms of algebraic function fields | 263 | |
A method to solve cyclotomic norm equations f * [actual symbol not reproducible] | 272 | |
Imaginary cyclic quartic fields with large minus class numbers | 280 | |
Nonic 3-adic fields | 293 | |
Montgomery addition for genus two curves | 309 | |
Numerical evaluation at negative integers of the Dedekind zeta functions of totally real cubic number fields | 318 | |
Salem numbers of trace -2 and traces of totally positive algebraic integers | 327 | |
Low-dimensional lattice basis reduction revisited | 338 | |
Computing order statistics in the Farey sequence | 358 | |
The discrete logarithm in logarithmic l-class groups and its applications in K-theory | 367 | |
Point counting on genus 3 non hyperelliptic curves | 379 | |
Algorithmic aspects of cubic function fields | 395 | |
A binary recursive Gcd algorithm | 411 | |
Lagrange resolvents constructed from Stark units | 426 | |
Cryptanalysis of a divisor class group based public-key cryptosystem | 442 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionAlgorithmic Number Theory
X
This Item is in Your InventoryAlgorithmic Number Theory
X
You must be logged in to review the productsX
X
X
Add Algorithmic Number Theory, This book constitutes the refereed proceedings of the 6th International Algorithmic Number Theory Symposium, ANTS 2004, held in Burlington, VT, USA, in June 2004. The 30 revised full papers presented together with 3 invited papers were carefully review, Algorithmic Number Theory to the inventory that you are selling on WonderClubX
X
Add Algorithmic Number Theory, This book constitutes the refereed proceedings of the 6th International Algorithmic Number Theory Symposium, ANTS 2004, held in Burlington, VT, USA, in June 2004. The 30 revised full papers presented together with 3 invited papers were carefully review, Algorithmic Number Theory to your collection on WonderClub |