33 search results - page 3 / 7 » Algorithms for Modular Counting of Roots of Multivariate Pol... |
SODA
2003
ACM
13 years 8 months ago
2003
ACM
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
FOCM
2008
13 years 6 months ago
2008
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
JOC
2007
13 years 6 months ago
2007
Abstract. We address one of the most fundamental problems concerning the RSA cryptosystem: does the knowledge of the RSA public and secret key-pair (e, d) yield the factorization o...
ANTS
2006
Springer
13 years 10 months ago
2006
Springer
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
DAGSTUHL
2006
13 years 8 months ago
2006
We consider the problem of sparse interpolation of a multivariate black-box polynomial in floating-point arithmetic. That is, both the inputs and outputs of the black-box polynomia...