358 search results - page 12 / 72 » Sparse squares of polynomials |
COCO
2011
Springer
12 years 7 months ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
FOCM
2008
13 years 7 months ago
2008
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
ICISC
2000
13 years 9 months ago
2000
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
XCS with computed prediction, namely XCSF, has been recently extended in several ways. In particular, a novel prediction update algorithm based on recursive least squares and the ...