The Complexity of two Problems on Arithmetic Circuits

Abstract : By using arithmetic circuits, encoding multivariate polynomials may be drastically more efficient than writing down the list of monomials. Via the study of two examples, we show however that such an encoding can be hard to handle with a Turing machine even if the degree of the polynomial is low. Namely we show that deciding whether the coefficient of a given monomial is zero is hard for P^{#P} under strong nondeterministic Turing reductions. As a result, this problem does not belong to the polynomial hierarchy unless this hierarchy collapses. For polynomials over fields of characteristic k > 0, this problem is Mod_k P-complete. This gives a coNP^{Mod_k P} algorithm for deciding an upper bound on the degree of a polynomial given by a circuit in fields of characteristic k > 0.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00167613
Contributor : Sylvain Perifel <>
Submitted on : Tuesday, August 21, 2007 - 6:07:44 PM
Last modification on : Wednesday, November 20, 2019 - 2:55:58 AM
Long-term archiving on : Thursday, April 8, 2010 - 9:23:39 PM

Files

circuits.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : ensl-00167613, version 1

Collections

Citation

Pascal Koiran, Sylvain Perifel. The Complexity of two Problems on Arithmetic Circuits. 2007. ⟨ensl-00167613⟩

Share

Metrics

Record views

165

Files downloads

340