CMA
2010
13 years 1 months ago
2010
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
FFA
2010
13 years 2 months ago
2010
Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan&...
ICMS
2010
13 years 2 months ago
2010
Abstract. Minimizing the evaluation cost of a polynomial expression is a fundamental problem in computer science. We propose tools that, for a polynomial P given as the sum of its ...
FOCS
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
TOMS
2010
13 years 3 months ago
2010
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
JSC
2010
13 years 3 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...
JAT
2010
13 years 3 months ago
2010
In this paper we find the second order linear differential equation satisfied by orthogonal polynomials with respect to the inner product p, q = ∞ 0 p(x)q(x)xα e−x dx + Mp...
FOCM
2010
13 years 3 months ago
2010
Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We...
FFA
2010
13 years 3 months ago
2010
Motivated by several recent results, we determine precisely when Fk(Xd, a) − Fk(0, a) is a Dembowski-Ostrom polynomial, where Fk(X, a) is a Dickson polynomial of the first or se...
DM
2008
13 years 3 months ago
2008
Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying pS(x + y) = TU=S pT (x)pU (y). Using umbral calculus, we give a formula for t...