Sciweavers

2924 search results - page 11 / 585
» Lower Bounds in Distributed Computing
Sort
View
MOC
2010
13 years 2 months ago
Computing a lower bound for the canonical height on elliptic curves over number fields
Computing a lower bound for the canonical height is a crucial step in determining a Mordell
Thotsaphon Thongjunthug
EPEW
2007
Springer
14 years 1 months ago
Closed Form Absorption Time Bounds
We consider a class of Markov chains known for its closed form transient and steady-state distributions. We show that some absorbing chains can be also seen as members of this clas...
Ana Busic, Nihal Pekergin
ANTS
2006
Springer
79views Algorithms» more  ANTS 2006»
13 years 11 months ago
Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q
Let E be an elliptic curve over the rationals. A crucial step in determining a Mordell-Weil basis for E is to exhibit some positive lower bound > 0 for the canonical height ^h ...
John Cremona, Samir Siksek