Inhalt des Dokuments
In Proceedings
| 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. |
Zusatzinformationen / Extras
Direktzugang
Schnellnavigation zur Seite über Nummerneingabe
Hilfsfunktionen
Diese Seite verwendet Matomo für anonymisierte Webanalysen. Mehr Informationen und Opt-Out-Möglichkeiten unter Datenschutz.