On a family of elliptic curves.
Antoniewicz, Anna (2005)
Zeszyty Naukowe Uniwersytetu Jagiellońskiego. Universitatis Iagellonicae Acta Mathematica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Antoniewicz, Anna (2005)
Zeszyty Naukowe Uniwersytetu Jagiellońskiego. Universitatis Iagellonicae Acta Mathematica
Similarity:
Berger, Robert W. (1994)
The New York Journal of Mathematics [electronic only]
Similarity:
Leclerc, Bernard (1998)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Dunkl, Charles F. (2010)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Ben Kane (2009)
Journal de Théorie des Nombres de Bordeaux
Similarity:
Assuming GRH, we present an algorithm which inputs a prime and outputs the set of fundamental discriminants such that the reduction map modulo a prime above from elliptic curves with CM by to supersingular elliptic curves in characteristic is surjective. In the algorithm we first determine an explicit constant so that implies that the map is necessarily surjective and then we compute explicitly the cases .
Dimitrov, Dimitar K., Merlo, Clinton A. (1998)
Revista Colombiana de Matemáticas
Similarity:
Panagiotis Tzekis, Nicholas Karampetakis, Haralambos Terzidis (2007)
International Journal of Applied Mathematics and Computer Science
Similarity:
The main contribution of this work is to provide an algorithm for the computation of the GCD of 2-D polynomials, based on DFT techniques. The whole theory is implemented via illustrative examples.
Winkel, Rudolf (1996)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Morse, Jennifer (1998)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Winkel, Rudolf (1997)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
J. Cheon, S. Hahn (1999)
Acta Arithmetica
Similarity: