2000 character limit reached
Monomials in arithmetic circuits: Complete problems in the counting hierarchy (1110.6271v2)
Published 28 Oct 2011 in cs.CC
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. We also study these questions for circuits computing multilinear polynomials.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.