computational complexity

, Volume 24, Issue 1, pp 1–30

Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy

Article

DOI: 10.1007/s00037-013-0079-3

Cite this article as:
Fournier, H., Malod, G. & Mengel, S. comput. complex. (2015) 24: 1. doi:10.1007/s00037-013-0079-3
  • 145 Downloads

Abstract

We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that these problems are complete for subclasses of the counting hierarchy which had few or no known natural complete problems before. We also study these questions for circuits computing multilinear polynomials and for univariate multiplicatively disjoint circuits.

Keywords

Arithmetic circuits counting problems polynomials 

Subject classification

68Q15 68Q17 03D15 

Copyright information

© Springer Basel 2014

Authors and Affiliations

  • Hervé Fournier
    • 1
  • Guillaume Malod
    • 2
  • Stefan Mengel
    • 3
  1. 1.Institut de Mathématiques de Jussieu, UMR 7586 CNRSUniv Paris Diderot, Sorbonne Paris CitéParisFrance
  2. 2.Institut de Mathématiques de Jussieu, UMR 7586 CNRSUniversity Paris Diderot, Sorbonne Paris CitéParisFrance
  3. 3.LIX, École PolytechniquePalaiseauFrance