Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=1122

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Counting rational points on curves and Abelian varieties over finite fields
Leonard M. Adleman, Ming-Deh A. Huang
Lecture Notes in Computer Science 1122, 1996, pp. 1-16
Computing cubic fields in quasi-linear time
K. Belabas
Lecture Notes in Computer Science 1122, 1996, pp. 17-25
Fast ideal arithmetic via lazy localization
Daniel J. Bernstein
Lecture Notes in Computer Science 1122, 1996, pp. 27-34
A comparative study of algorithms for computing continued fractions of algebraic numbers
Richard P. Brent, Alfred J. van der Poorten, Herman J.J. te Riele
Lecture Notes in Computer Science 1122, 1996, pp. 35-47
Computing ray class groups, conductors and discriminants
H. Cohen, F. Diaz y Diaz, M. Olivier
Lecture Notes in Computer Science 1122, 1996, pp. 49-57
Computing l-isogenies using the p-torsion
Jean-Marc Couveignes
Lecture Notes in Computer Science 1122, 1996, pp. 59-65
On computing Hilbert class fields of prime degree
M. Daberkow, M.E. Pohst
Lecture Notes in Computer Science 1122, 1996, pp. 67-74
On the reduction of composed relations from the number field sieve
Thomas F. Denny, Volker Müller
Lecture Notes in Computer Science 1122, 1996, pp. 75-90
Checking the p-adic Stark conjecture when p is Archimedean
David S. Dummit, David R. Hayes
Lecture Notes in Computer Science 1122, 1996, pp. 91-97
A multiple polynomial General Number Field Sieve
Marije Elkenbracht-Huizing
Lecture Notes in Computer Science 1122, 1996, pp. 99-114
Construction of high-rank elliptic curves over Q and Q(t) with non-trivial 2-torsion
Stéfane Fermigier
Lecture Notes in Computer Science 1122, 1996, pp. 115-120
The height on an Abelian variety
Bríd ní Fhlathúin
Lecture Notes in Computer Science 1122, 1996, pp. 121-131
On lattices over number fields
C. Fieker, M.E. Pohst
Lecture Notes in Computer Science 1122, 1996, pp. 133-139
Minimum discriminants of primitive sextic fields
David Ford
Lecture Notes in Computer Science 1122, 1996, pp. 141-143
A new algorithm and refined bounds for extended Gcd computation
David Ford, George Havas
Lecture Notes in Computer Science 1122, 1996, pp. 145-150
Application of Thue equations to computing power integral bases in algebraic number fields
István Gaál
Lecture Notes in Computer Science 1122, 1996, pp. 151-155
Computing S-integral points on elliptic curves
Josef Gebel, Attila Pethŏ, Horst G. Zimmer
Lecture Notes in Computer Science 1122, 1996, pp. 157-171
Probabilistic computation of the Smith normal form of a sparse integer matrix
Mark Giesbrecht
Lecture Notes in Computer Science 1122, 1996, pp. 173-186
Ray class field constructions of curves over finite fields with many rational points
Kristin Lauter
Lecture Notes in Computer Science 1122, 1996, pp. 187-195
Computing isogenies in F_{2^n}
Reynald Lercier
Lecture Notes in Computer Science 1122, 1996, pp. 197-212
A computational technique for determining relative class numbers of CM-fields
Stéphane Louboutin
Lecture Notes in Computer Science 1122, 1996, pp. 213-216
Old and new deterministic factoring algorithms
James McKee, Richard Pinch
Lecture Notes in Computer Science 1122, 1996, pp. 217-224
Efficient algorithms for computing the Jacobi symbol
Shawna M. Meyer, Jonathan P. Sorenson
Lecture Notes in Computer Science 1122, 1996, pp. 225-239
The number field database on the World Wide Web server http://hasse.mathematik.tu-muenchen.de/
Gerhard Niklasch
Lecture Notes in Computer Science 1122, 1996, pp. 241-242
An algorithm of subexponential type computing the class group of quadratic orders over principal ideal domains
Sachar Paulus
Lecture Notes in Computer Science 1122, 1996, pp. 243-257

Seiten 1 2 >