1380 search results - page 67 / 276 » A General Polynomial Sieve |
ISSAC
2004
Springer
14 years 2 months ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
FPCA
1995
14 years 10 days ago
1995
Fold and unfold are general purpose functionals for processing and constructing lists. By using the categorical approach of modelling recursive datatypes as fixed points of funct...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We exhibit the rich structure of the set of correlated equilibria by analyzing the simplest of polynomial games: the mixed extension of matching pennies. We show that while the co...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In their paper on the "chasm at depth four", Agrawal and Vinay have shown that polynomials in m variables of degree O(m) which admit arithmetic circuits of size 2o(m) al...
FOCM
2006
13 years 8 months ago
2006
The main result of this paper is a new version of Newton-Hensel lifting that relates to interpolation questions. It allows one to lift polynomials in Z[x] from information modulo a...