The Complexity of two Problems on Arithmetic Circuits - ENS de Lyon - École normale supérieure de Lyon Access content directly
Preprints, Working Papers, ... Year : 2007

The Complexity of two Problems on Arithmetic Circuits


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.
Fichier principal
Vignette du fichier
circuits.pdf (211.23 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

ensl-00167613 , version 1 (21-08-2007)


  • HAL Id : ensl-00167613 , version 1


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


Gmail Mastodon Facebook X LinkedIn More