Add to ORKGInternational audienceWe 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
AbstractIn their paper on the “chasm at depth four”, Agrawal and Vinay have shown that polynomials i...
AbstractWe study a new method for proving lower bounds for subclasses of arithmetic circuits. Roughl...
AbstractWe investigate the complexity of satisfiability problems for {∪,∩,−,+,×}-circuits computing ...
We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whe...
We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whe...
We study the problem of testing if the polynomial computed by an arithmetic circuit is identically z...
A {+,×}-circuit counts a given multivariate polynomial f, if its values on 0-1 inputs are the same a...
16 pagesBy using arithmetic circuits, encoding multivariate polynomials may be drastically more effi...
AbstractBy using arithmetic circuits, encoding multivariate polynomials may be drastically more effi...
Arithmetic Circuits compute polynomial functions over their inputs via a sequence of arithmetic oper...
16 pagesBy using arithmetic circuits, encoding multivariate polynomials may be drastically more effi...
We study the complexity of detecting monomials with special properties in the sum-product expansion ...
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The...
In their paper on the ''chasm at depth four'', Agrawal and Vinay have shown that polynomials in m va...
We introduce a new and very natural algebraic proof system, which has tight connections to (algebrai...
AbstractIn their paper on the “chasm at depth four”, Agrawal and Vinay have shown that polynomials i...
AbstractWe study a new method for proving lower bounds for subclasses of arithmetic circuits. Roughl...
AbstractWe investigate the complexity of satisfiability problems for {∪,∩,−,+,×}-circuits computing ...
We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whe...
We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whe...
We study the problem of testing if the polynomial computed by an arithmetic circuit is identically z...
A {+,×}-circuit counts a given multivariate polynomial f, if its values on 0-1 inputs are the same a...
16 pagesBy using arithmetic circuits, encoding multivariate polynomials may be drastically more effi...
AbstractBy using arithmetic circuits, encoding multivariate polynomials may be drastically more effi...
Arithmetic Circuits compute polynomial functions over their inputs via a sequence of arithmetic oper...
16 pagesBy using arithmetic circuits, encoding multivariate polynomials may be drastically more effi...
We study the complexity of detecting monomials with special properties in the sum-product expansion ...
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The...
In their paper on the ''chasm at depth four'', Agrawal and Vinay have shown that polynomials in m va...
We introduce a new and very natural algebraic proof system, which has tight connections to (algebrai...
AbstractIn their paper on the “chasm at depth four”, Agrawal and Vinay have shown that polynomials i...
AbstractWe study a new method for proving lower bounds for subclasses of arithmetic circuits. Roughl...
AbstractWe investigate the complexity of satisfiability problems for {∪,∩,−,+,×}-circuits computing ...