Sciweavers

ESA
2010
Springer
126views Algorithms» more  ESA 2010»
13 years 5 months ago
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus
In this paper, we show that for an n-vertex graph G of genus g, the edge expansion of G can be determined in time nO(g2 ) . We show that the same is true for various other similar ...
Viresh Patel
ANTS
2008
Springer
133views Algorithms» more  ANTS 2008»
13 years 6 months ago
Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors
We discuss arithmetic in the Jacobian of a hyperelliptic curve C of genus g. The traditional approach is to fix a point P C and represent divisor classes in the form E - d(P) wher...
Steven D. Galbraith, Michael Harrison, David J. Mi...