TU Berlin

Fachgebiet Algorithmische AlgebraRefereed Contributions

Page Content

to Navigation

There is no English translation for this web page.

Refereed Contributions

Monomials in arithmetic circuits: Complete problems in the counting hierarchy
Citation key FMM-Monomials-In-Arithmetic-Circuits-Complete-Problems-In-The-Counting-Hierarchy
Author Hervé Fournier and Guillaume Malod and Stefan Mengel
Title of Book Proceedings Symposium on Theoretical Aspects of Computer Science (STACS) 2012
Year 2012
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.
Link to publication Link to original publication Download Bibtex entry


Quick Access

Schnellnavigation zur Seite über Nummerneingabe