Add to ORKGWe show that the two main reduction notions in arithmetic circuit complexity, p-projections and c-reductions, differ in power. We do so by showing unconditionally that there are polynomials that are VNP-complete under c-reductions but not under p-projections. We also show that the question of which polynomials are VNP-complete under which type of reductions depends on the underlying field
It is widely believed that the Permanent polynomial requires superpolynomial size arithmetic circuit...
This work is devoted to explore the novel method of proving circuit lower bounds for the class NEXP ...
We investigate the phenomenon of depth-reduction in commutative and non-commutative arithmetic circu...
We show that the two main reduction notions in arithmetic circuit complexity, p-projections and c-re...
Arithmetic Circuits compute polynomial functions over their inputs via a sequence of arithmetic oper...
In 1979 Valiant introduced the complexity class VNP of p-definable families of polynomials, he defin...
16 pagesBy using arithmetic circuits, encoding multivariate polynomials may be drastically more effi...
Arithmetic complexity is the study of the required ressources for computing poynomials using only ar...
Abstract. We consider the complexity class ACC1 and related families of arithmetic circuits. We prov...
We investigate the phenomenon of depth-reduction in commutative and non-commutative arithmetic circu...
In circuit complexity, the polynomial method is a general approach to proving circuit lower bounds i...
AbstractBy using arithmetic circuits, encoding multivariate polynomials may be drastically more effi...
AbstractUnder the assumption that NP does not have p-measure 0, we investigate reductions to NP-comp...
The fundamental Minimum Circuit Size Problem is a well-known example of a problem that is neither kn...
We say that a circuit C over a field F {functionally} computes a polynomial P in F[x_1, x_2, ..., x_...
It is widely believed that the Permanent polynomial requires superpolynomial size arithmetic circuit...
This work is devoted to explore the novel method of proving circuit lower bounds for the class NEXP ...
We investigate the phenomenon of depth-reduction in commutative and non-commutative arithmetic circu...
We show that the two main reduction notions in arithmetic circuit complexity, p-projections and c-re...
Arithmetic Circuits compute polynomial functions over their inputs via a sequence of arithmetic oper...
In 1979 Valiant introduced the complexity class VNP of p-definable families of polynomials, he defin...
16 pagesBy using arithmetic circuits, encoding multivariate polynomials may be drastically more effi...
Arithmetic complexity is the study of the required ressources for computing poynomials using only ar...
Abstract. We consider the complexity class ACC1 and related families of arithmetic circuits. We prov...
We investigate the phenomenon of depth-reduction in commutative and non-commutative arithmetic circu...
In circuit complexity, the polynomial method is a general approach to proving circuit lower bounds i...
AbstractBy using arithmetic circuits, encoding multivariate polynomials may be drastically more effi...
AbstractUnder the assumption that NP does not have p-measure 0, we investigate reductions to NP-comp...
The fundamental Minimum Circuit Size Problem is a well-known example of a problem that is neither kn...
We say that a circuit C over a field F {functionally} computes a polynomial P in F[x_1, x_2, ..., x_...
It is widely believed that the Permanent polynomial requires superpolynomial size arithmetic circuit...
This work is devoted to explore the novel method of proving circuit lower bounds for the class NEXP ...
We investigate the phenomenon of depth-reduction in commutative and non-commutative arithmetic circu...