We consider arithmetic complexity classes that are in some sense dual to the classes VP(Fp) that were introduced by Valiant. This provides new characterizations of the complexity classes ACC1 and TC1, and also provides a compelling example of a class of high-degree polynomials that can be simulated via arithmetic circuits of much lower degree.
Valiant defines algebraic analogues of the classes P and NP. We characterize the classes VP and VQP,...
In 1979 Valiant showed that the complexity class VP_e of families with polynomially bounded formula ...
Arithmetic Circuits compute polynomial functions over their inputs via a sequence of arithmetic oper...
Abstract. We consider the complexity class ACC1 and related families of arithmetic circuits. We prov...
An account of Valiant's theory of p-computable versus p-definable polynomials, an arithmetic analogu...
We continue the study of the complexity classes VP(Zm) and ΛP(Zm) which was initiated in [AGM15]. We...
In Valiant developed an algebraic analogue of the theory of NP-completeness for computations of po...
Arithmetic complexity is the study of the required ressources for computing poynomials using only ar...
We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean...
13 pagesWe investigate the following question: if a polynomial can be evaluated at rational points b...
Abstract. We investigate the following question: if a polynomial can be evaluated at rational points...
We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean...
In 1979 Valiant showed that the complexity class VPe of families with polynomially bounded formula s...
The boolean circuit complexity classes AC 0 ⊆ AC 0[m] ⊆ TC 0 ⊆ NC 1 have been studied intensely. Oth...
Let tau(k) be the minimum number of arithmetic operations required to build the integer k from the c...
Valiant defines algebraic analogues of the classes P and NP. We characterize the classes VP and VQP,...
In 1979 Valiant showed that the complexity class VP_e of families with polynomially bounded formula ...
Arithmetic Circuits compute polynomial functions over their inputs via a sequence of arithmetic oper...
Abstract. We consider the complexity class ACC1 and related families of arithmetic circuits. We prov...
An account of Valiant's theory of p-computable versus p-definable polynomials, an arithmetic analogu...
We continue the study of the complexity classes VP(Zm) and ΛP(Zm) which was initiated in [AGM15]. We...
In Valiant developed an algebraic analogue of the theory of NP-completeness for computations of po...
Arithmetic complexity is the study of the required ressources for computing poynomials using only ar...
We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean...
13 pagesWe investigate the following question: if a polynomial can be evaluated at rational points b...
Abstract. We investigate the following question: if a polynomial can be evaluated at rational points...
We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean...
In 1979 Valiant showed that the complexity class VPe of families with polynomially bounded formula s...
The boolean circuit complexity classes AC 0 ⊆ AC 0[m] ⊆ TC 0 ⊆ NC 1 have been studied intensely. Oth...
Let tau(k) be the minimum number of arithmetic operations required to build the integer k from the c...
Valiant defines algebraic analogues of the classes P and NP. We characterize the classes VP and VQP,...
In 1979 Valiant showed that the complexity class VP_e of families with polynomially bounded formula ...
Arithmetic Circuits compute polynomial functions over their inputs via a sequence of arithmetic oper...
DOI
Add to ORKG