Atjaunināt sīkdatņu piekrišanu

E-grāmata: Algorithmic Number Theory: 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010, Proceedings

Edited by , Edited by , Edited by
  • Formāts - PDF+DRM
  • Cena: 53,52 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Ielikt grozā
  • Pievienot vēlmju sarakstam
  • Šī e-grāmata paredzēta tikai personīgai lietošanai. E-grāmatas nav iespējams atgriezt un nauda par iegādātajām e-grāmatām netiek atmaksāta.

DRM restrictions

  • Kopēšana (kopēt/ievietot):

    nav atļauts

  • Drukāšana:

    nav atļauts

  • Lietošana:

    Digitālo tiesību pārvaldība (Digital Rights Management (DRM))
    Izdevējs ir piegādājis šo grāmatu šifrētā veidā, kas nozīmē, ka jums ir jāinstalē bezmaksas programmatūra, lai to atbloķētu un lasītu. Lai lasītu šo e-grāmatu, jums ir jāizveido Adobe ID. Vairāk informācijas šeit. E-grāmatu var lasīt un lejupielādēt līdz 6 ierīcēm (vienam lietotājam ar vienu un to pašu Adobe ID).

    Nepieciešamā programmatūra
    Lai lasītu šo e-grāmatu mobilajā ierīcē (tālrunī vai planšetdatorā), jums būs jāinstalē šī bezmaksas lietotne: PocketBook Reader (iOS / Android)

    Lai lejupielādētu un lasītu šo e-grāmatu datorā vai Mac datorā, jums ir nepieciešamid Adobe Digital Editions (šī ir bezmaksas lietotne, kas īpaši izstrādāta e-grāmatām. Tā nav tas pats, kas Adobe Reader, kas, iespējams, jau ir jūsu datorā.)

    Jūs nevarat lasīt šo e-grāmatu, izmantojot Amazon Kindle.

ANTS-IX was the ninth edition of the biennial International Symposium on Algorithmic Number Theory. The ?rst edition of this symposium was held at Cornell University in 1994. ANTS-IX was held July 19-23, 2010 at INRIA in Nancy, France. The ANTS-IX Program Committee consisted of 12 members whose names are listed on the next page. The selection of the accepted papers among the submissions was made from mid-January to end of March 2010. Each paper was thoroughly reviewed by at least two experts, including a Program Committee member. The Program Committee selected 25 high-quality articles, which are excellent representatives of the current state of the art in various areas of - gorithmic number theory. The Selfridge Prize in computational number theory was awarded to the authors of the best contributed paper presented at the c- ference. We gratefully thank the authors of all submitted papers for their hard work which made the selection of a varied program possible. We also thank the authors of the accepted papers for their cooperation in the timely production of the revised versions. Each submitted paper was presented by one of its co-authors at the c- ference. Besides contributed papers, the conference included ?ve invited talks by Henri Darmon (McGill University), Jean-Fran, cois Mestre (Universit'eParis 7), Gabriele Nebe (RWTH Aachen), Carl Pomerance (Dartmouth College), and Oded Regev (Tel-Aviv University).
Invited papers
Putting the Hodge and Tate Conjectures to the Test
1(1)
Henri Darmon
Curves of Genus 3 With a Group of Automorphisms Isomorphic to S3
2(1)
Jean-Francois Mestre
Learning with Errors over Rings
3(1)
Oded Regev
Lattices and Spherical Designs
4(2)
Gabriele Nebe
Fixed Points for Discrete Logarithms
6(10)
Mariana Levin
Carl Pomerance
K. Soundararajan
Contributed papers
Explicit Coleman Integration for Hyperelliptic Curves
16(16)
Jennifer S. Balakrishnan
Robert W. Bradshaw
Kiran S. Kedlaya
Smallest Reduction Matrix of Binary Quadratic Forms: And Cryptographic Applications
32(18)
Aurore Bernard
Nicolas Gama
Practical Improvements to Class Group and Regulator Computation of Real Quadratic Fields
50(16)
Jean-Francois Biasse
Michael J. Jacobson Jr.
On the Use of the Negation Map in the Pollard Rho Method
66(17)
Joppe W. Bos
Thorsten Kleinjung
Arjen K. Lenstra
An O(M(n) log n) Algorithm for the Jacobi Symbol
83(13)
Richard P. Brent
Paul Zimmermann
New Families of ECM Curves for Cunningham Numbers
96(14)
Eric Brier
Christophe Clavier
Visualizing Elements of Sha[ 3] in Genus 2 Jacobians
110(16)
Nils Bruin
Sander R. Dahmen
On Weil polynomials of K3 surfaces
126(16)
Andreas-Stephan Elsenhans
Jorg Jahnel
Class Invariants by the CRT Method
142(15)
Andreas Enge
Andrew V. Sutherland
Short Bases of Lattices over Number Fields
157(17)
Claus Fieker
Damien Stehle
On the Complexity of the Montes Ideal Factorization Algorithm
174(12)
David Ford
Olga Veres
Congruent Number Theta Coefficients to 1012
186(15)
William B. Hart
Gonzalo Tornaria
Mark Watkins
Pairing the Volcano
201(18)
Sorina Ionica
Antoine Joux
A Subexponential Algorithm for Evaluating Large Degree Isogenies
219(15)
David Jao
Vladimir Soukharev
Huff's Model for Elliptic Curves
234(17)
Marc Joye
Mehdi Tibouchi
Damien Vergnaud
Efficient Pairing Computation With Theta Functions
251(19)
David Lubicz
Damien Robert
Small-Span Characteristic Polynomials of Integer Symmetric Matrices
270(15)
James McKee
Decomposition Attack for the Jacobian of a Hyperelliptic Curve over an Extension Field
285(16)
Koh-Ichi Nagao
Factoring Polynomials over Local Fields II
301(15)
Sebastian Pauli
On a Problem of Hajdu and Tengely
316(15)
Samir Siksek
Michael Stoll
Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures
331(9)
Jonathan P. Sorenson
On the Extremality of an 80-Dimensional Lattice
340(17)
Damien Stehle
Mark Watkins
Computing Automorphic Forms on Shimura Curves over Fields with Arbitrary Class Number
357(15)
John Voight
Improved Primality Proving with Eisenstein Pseudocubes
372(13)
Kjell Wooding
H.C. Williams
Hyperbolic Tessellations Associated to Bianchi Groups
385(12)
Dan Yasaki
Author Index 397