136 search results - page 2 / 28 » On the generation of multivariate polynomials which are hard... |
EUROCRYPT
2006
Springer
13 years 9 months ago
2006
Springer
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which ...
ECCC
1998
13 years 5 months ago
1998
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
JC
2008
13 years 5 months ago
2008
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
ECCC
2011
13 years 18 days ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...