APPROX
2008
Springer
13 years 12 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
APPROX
2008
Springer
13 years 12 months ago
2008
Springer
APPROX
2008
Springer
13 years 12 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
APPROX
2008
Springer
13 years 12 months ago
2008
Springer
Abstract. We construct an efficient 3-source extractor that requires one of the sources to be significantly shorter than the min-entropy of the other two sources. Our extractors wo...
APPROX
2008
Springer
13 years 12 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
APPROX
2008
Springer
13 years 12 months ago
2008
Springer
We give an explicit construction of a function that is almost a 2-source extractor for linear entropy, it is a condenser where the output has almost full entropy. Given 2 sources w...
ANTS
2008
Springer
13 years 12 months ago
2008
Springer
Abstract. In this paper, we discuss an implementation of various algorithms for multiplying polynomials in GF(2)[x]: variants of the window methods, Karatsuba's, Toom-Cook...
ANTS
2008
Springer
13 years 12 months ago
2008
Springer
We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic...
ANTS
2008
Springer
13 years 12 months ago
2008
Springer
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...
ANTS
2008
Springer
13 years 12 months ago
2008
Springer
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...