37 search results - page 3 / 8 » On the Degree of Univariate Polynomials Over the Integers |
87
Voted
MOC
1998
14 years 11 months ago
1998
D. Wan very recently proved an asymptotic version of a conjecture of Hansen and Mullen concerning the distribution of irreducible polynomials over finite fields. In this note we ...
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...
82
Voted
CIE
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
JSC
2010
14 years 10 months ago
2010
We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of Rk , assuming that P is p...
90
Voted
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...