Monomials in arithmetic circuits: Complete problems in the counting hierarchy
Computational Complexity
2012-03-28 v2
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. We also study these questions for circuits computing multilinear polynomials.
Keywords
Cite
@article{arxiv.1110.6271,
title = {Monomials in arithmetic circuits: Complete problems in the counting hierarchy},
author = {Hervé Fournier and Guillaume Malod and Stefan Mengel},
journal= {arXiv preprint arXiv:1110.6271},
year = {2012}
}