A hitting set construction, with application to arithmetic circuit lower bounds - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

A hitting set construction, with application to arithmetic circuit lower bounds

(1)
1

Abstract

A polynomial identity testing algorithm must determine whether a given input polynomial is identically equal to 0. We give a deterministic black-box identity testing algorithm for univariate polynomials of the form $\sum_{j=0}^t c_j X^{\alpha_j} (a + b X)^{\beta_j}$. From our algorithm we derive an exponential lower bound for representations of polynomials such as $\prod_{i=1}^{2^n} (X^i-1)$ under this form. It has been conjectured that these polynomials are hard to compute by general arithmetic circuits. Our result shows that the ``hardness from derandomization'' approach to lower bounds is feasible for a restricted class of arithmetic circuits. The proof is based on techniques from algebraic number theory, and more precisely on properties of the height function of algebraic numbers.
Fichier principal
Vignette du fichier
fields.pdf (179.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-00408713 , version 1 (31-07-2009)
ensl-00408713 , version 2 (07-12-2009)

Identifiers

Cite

Pascal Koiran. A hitting set construction, with application to arithmetic circuit lower bounds. 2009. ⟨ensl-00408713v2⟩
48 View
210 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More