Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Shallow Circuits with High-Powered Inputs

Abstract : A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show that a deterministic black-box identity testing algorithm for (high-degree) univariate polynomials would imply a lower bound on the arithmetic complexity of the permanent. The lower bounds that are known to follow from derandomization of (low-degree) multivariate identity testing are weaker. To obtain our lower bound it would be sufficient to derandomize identity testing for polynomials of a very specific norm: sums of products of sparse polynomials with sparse coefficients. This observation leads to new versions of the Shub-Smale tau-conjecture on integer roots of univariate polynomials. In particular, we show that a lower bound for the permanent would follow if one could give a good enough bound on the number of real roots of sums of products of sparse polynomials (Descartes' rule of signs gives such a bound for sparse polynomials and products thereof). In this third version of our paper we show that the same lower bound would follow even if one could only prove a slightly superpolynomial upper bound on the number of real roots. This is a consequence of a new result on reduction to depth 4 for arithmetic circuits which we establish in a companion paper. We also show that an even weaker bound on the number of real roots would suffice to obtain a lower bound on the size of depth 4 circuits computing the permanent.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00477023
Contributor : Pascal Koiran <>
Submitted on : Wednesday, July 28, 2010 - 5:07:16 PM
Last modification on : Friday, September 10, 2021 - 2:34:03 PM
Long-term archiving on: : Friday, October 29, 2010 - 10:44:51 AM

Files

v3prunel.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : ensl-00477023, version 3
  • ARXIV : 1004.4960

Collections

Citation

Pascal Koiran. Shallow Circuits with High-Powered Inputs. 2010. ⟨ensl-00477023v3⟩

Share

Metrics

Record views

8

Files downloads

9