TU Berlin

Fachgebiet Algorithmische AlgebraRefereed Contributions

Inhalt des Dokuments

zur Navigation

Refereed Contributions

Monomials in arithmetic circuits: Complete problems in the counting hierarchy
Zitatschlüssel FMM-Monomials-In-Arithmetic-Circuits-Complete-Problems-In-The-Counting-Hierarchy
Autor Hervé Fournier and Guillaume Malod and Stefan Mengel
Buchtitel Proceedings Symposium on Theoretical Aspects of Computer Science (STACS) 2012
Jahr 2012
Zusammenfassung 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 zur Publikation Link zur Originalpublikation Download Bibtex Eintrag



Schnellnavigation zur Seite über Nummerneingabe