Computing canonical heights with little (or no) factorization
暂无分享,去创建一个
[1] J. Cremona. Algorithms for Modular Elliptic Curves , 1992 .
[2] Paul Ernest,et al. The mathematics department , 1988 .
[3] Michael Laska,et al. An algorithm for finding a minimal Weierstrass equation for an elliptic curve , 1982 .
[4] H. G. Zimmer,et al. Computation of the Néron-Tate height on elliptic curves , 1987 .
[5] Joseph H. Silverman,et al. The arithmetic of elliptic curves , 1986, Graduate texts in mathematics.
[6] Demjanenko matrix and 2-divisibility of class numbers , 1993 .
[7] H. W. Lenstra,et al. Factoring integers with elliptic curves , 1987 .
[8] J. Silverman. Advanced Topics in the Arithmetic of Elliptic Curves , 1994 .
[9] Henri Cohen,et al. A course in computational algebraic number theory , 1993, Graduate texts in mathematics.
[10] H. Riesel. Prime numbers and computer methods for factorization , 1985 .
[11] F. Hazama. Demjanenko matrix, class number, and Hodge group , 1990 .
[12] S. Fermigier,et al. Un exemple de courbe elliptique définie sur Q de rang ≥19 , 1992 .
[13] K. Nagao,et al. An example of elliptic curve over Q with rank 21 , 1993 .
[14] Joseph H. Silverman,et al. Computing heights on elliptic curves , 1988 .
[15] J. Tate,et al. Algorithm for determining the type of a singular fiber in an elliptic pencil , 1975 .
[16] Horst Günter Zimmer,et al. What is the Rank of the Demjanenko Matrix? , 1987, J. Symb. Comput..