205 search results - page 4 / 41 » Complexity of Polynomial Multiplication over Finite Fields |
AMAI
2006
Springer
13 years 7 months ago
2006
Springer
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
MOC
2002
13 years 7 months ago
2002
This paper presents an average time analysis of a Hensel lifting based factorisation algorithm for bivariate polynomials over finite fields. It is shown that the average running ti...
ISSAC
1997
Springer
13 years 11 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
FFA
2010
13 years 5 months ago
2010
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact for...