Document Open Access Logo

Monomials in arithmetic circuits: Complete problems in the counting hierarchy

Authors Hervé Fournier, Guillaume Malod, Stefan Mengel



PDF
Thumbnail PDF

File

LIPIcs.STACS.2012.362.pdf
  • Filesize: 0.85 MB
  • 12 pages

Document Identifiers

Author Details

Hervé Fournier
Guillaume Malod
Stefan Mengel

Cite AsGet BibTex

Hervé Fournier, Guillaume Malod, and Stefan Mengel. Monomials in arithmetic circuits: Complete problems in the counting hierarchy. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 362-373, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012)
https://doi.org/10.4230/LIPIcs.STACS.2012.362

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.
Keywords
  • arithmetic circuits
  • counting problems
  • polynomials

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail