Page Content
There is no English translation for this web page.
Dr. Stefan Mengel
- © Stefan Mengel
CRIL-CNRS/Université d'Artois
Faculté des Sciences Jean Perrin
rue Jean Souvraz, S.P. 18
F-62307 LENS Cedex
FRANCE Persönliche Homepage
www.cril.univ-artois.fr/~mengel/
Publikationen in der Arbeitsgruppe
| 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. |
Zusatzinformationen / Extras
Quick Access:
Schnellnavigation zur Seite über Nummerneingabe
Auxiliary Functions
This site uses Matomo for anonymized webanalysis. Visit Data Privacy for more information and opt-out options.