Sciweavers

484 search results - page 2 / 97
» Computing Hilbert Class Polynomials
Sort
View
ANTS
2008
Springer
115views Algorithms» more  ANTS 2008»
13 years 6 months ago
Computing Hilbert Modular Forms over Fields with Nontrivial Class Group
In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degr...
Lassina Dembélé, Steve Donnelly
JC
2006
105views more  JC 2006»
13 years 4 months ago
On the complexity of the resolvent representation of some prime differential ideals
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solern&oa...
ISSAC
2007
Springer
88views Mathematics» more  ISSAC 2007»
13 years 11 months ago
Polynomial-time algorithm for Hilbert series of Borel type ideals
In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D ...
Amir Hashemi
JOC
2010
96views more  JOC 2010»
12 years 11 months ago
On the Efficient Generation of Prime-Order Elliptic Curves
We consider the generation of prime-order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
Elisavet Konstantinou, Aristides Kontogeorgis, Yan...