We continue the study of the complexity classes VP(Zm) and ΛP(Zm) which was initiated in [AGM15]. We distinguish between “strict ” and “lax ” versions of these classes and prove some new equalities and inclu-sions between these arithmetic circuit classes and various subclasses of ACC1.
We investigate the phenomenon of depth-reduction in commutative and non-commutative arithmetic circu...
AbstractWe investigate the phenomenon of depth-reduction in commutative and non-commutative arithmet...
We investigate the phenomenon of depth-reduction in commutative and non-commutative arithmetic circu...
Abstract. We consider the complexity class ACC1 and related families of arithmetic circuits. We prov...
We consider arithmetic complexity classes that are in some sense dual to the classes VP(Fp) that wer...
The boolean circuit complexity classes AC 0 ⊆ AC 0[m] ⊆ TC 0 ⊆ NC 1 have been studied intensely. Oth...
This talk reviews recent developments in algebraic complexity theory. It outlines some major results...
Arithmetic Circuits compute polynomial functions over their inputs via a sequence of arithmetic oper...
La complexité arithmétique est l’étude des ressources nécessaires pour calcu- ler des polynômes en n...
AbstractWe define the counting classes #NC1,GapNC1,PNC1, andC=NC1. We prove that boolean circuits, a...
We present improved uniform TC 0 circuits for division, matrix powering, and related problems, where...
In 1990 Subramanian defined the complexity class CC as the set of problems log-space reducible to th...
In this thesis, we study small, yet important, circuit complexity classes within NC^1, such as ACC^0...
It is widely believed that the Permanent polynomial requires superpolynomial size arithmetic circuit...
In this thesis, we study small, yet important, circuit complexity classes within NC1, such as ACC0 a...
We investigate the phenomenon of depth-reduction in commutative and non-commutative arithmetic circu...
AbstractWe investigate the phenomenon of depth-reduction in commutative and non-commutative arithmet...
We investigate the phenomenon of depth-reduction in commutative and non-commutative arithmetic circu...
Abstract. We consider the complexity class ACC1 and related families of arithmetic circuits. We prov...
We consider arithmetic complexity classes that are in some sense dual to the classes VP(Fp) that wer...
The boolean circuit complexity classes AC 0 ⊆ AC 0[m] ⊆ TC 0 ⊆ NC 1 have been studied intensely. Oth...
This talk reviews recent developments in algebraic complexity theory. It outlines some major results...
Arithmetic Circuits compute polynomial functions over their inputs via a sequence of arithmetic oper...
La complexité arithmétique est l’étude des ressources nécessaires pour calcu- ler des polynômes en n...
AbstractWe define the counting classes #NC1,GapNC1,PNC1, andC=NC1. We prove that boolean circuits, a...
We present improved uniform TC 0 circuits for division, matrix powering, and related problems, where...
In 1990 Subramanian defined the complexity class CC as the set of problems log-space reducible to th...
In this thesis, we study small, yet important, circuit complexity classes within NC^1, such as ACC^0...
It is widely believed that the Permanent polynomial requires superpolynomial size arithmetic circuit...
In this thesis, we study small, yet important, circuit complexity classes within NC1, such as ACC0 a...
We investigate the phenomenon of depth-reduction in commutative and non-commutative arithmetic circu...
AbstractWe investigate the phenomenon of depth-reduction in commutative and non-commutative arithmet...
We investigate the phenomenon of depth-reduction in commutative and non-commutative arithmetic circu...
Add to ORKG