1730 search results - page 73 / 346 » Shimura Curve Computations |
156
click to vote
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
116
click to vote
ANTS
2008
Springer
15 years 6 months ago
2008
Springer
Let K be a p-adic local field and E an elliptic curve defined over K. The component group of E is the group E(K)/E0(K), where E0(K) denotes the subgroup of points of good reduction...
134
click to vote
MICS
2010
15 years 2 months ago
2010
Abstract. Following Gaudry and G¨urel who extended Kedlaya’s point-counting algorithm to superelliptic curves, we introduce Harvey’s running time improvements for large enough...
149
click to vote
DCC
2011
IEEE
14 years 11 months ago
2011
IEEE
In this paper, we present a novel method for constructing a super-optimal pairing with great efficiency, which we call the omega pairing. The computation of the omega pairing requi...
116
click to vote
COMPGEOM
1989
ACM
15 years 8 months ago
1989
ACM
We present algorithms that decompose an algebraic curve with rational coefficients in its defining bivariate equation into its irreducible real factors and its non-empty irreducib...