Sciweavers

Share
CC
2015
Springer

Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy

4 years 2 months ago
Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy
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.
Hervé Fournier, Guillaume Malod, Stefan Men
Added 17 Apr 2016
Updated 17 Apr 2016
Type Journal
Year 2015
Where CC
Authors Hervé Fournier, Guillaume Malod, Stefan Mengel
Comments (0)
books