Haupt-Navigation

Arbeitsgruppe

Lehre

Veranstaltungen
Abschlussarbeiten

Inhalt des Dokuments

Search for Publication

All Publications

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 [1] Link zur Originalpublikation [2] Download Bibtex Eintrag [3]

Zurück [4]

------ Links: ------

[1] http://arxiv.org/abs/1110.6271

[2] http://www3.math.tu-berlin.de/algebra/work/monomial
sSTACS12.pdf

[3] https://www.math.tu-berlin.de/fachgebiete_ag_diskal
g/fachgebiet_algorithmische_algebra/v_menue/publication
s/parameter/de/font5/maxhilfe/?no_cache=1&tx_sibibt
ex_pi1%5Bdownload_bibtex_uid%5D=1351077&tx_sibibtex
_pi1%5Bcontentelement%5D=tt_content%3A541745

[4] https://www.math.tu-berlin.de/fachgebiete_ag_diskal
g/fachgebiet_algorithmische_algebra/v_menue/publication
s/parameter/de/font5/maxhilfe/