Arithmetic circuit classes over Zm

نویسندگان

Eric Allender

Asa Goodwillie

چکیده

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 inclusions between these arithmetic circuit classes and various subclasses of ACC.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Powering requires threshold depth 3

We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m 6 poly(n). Let L̂Td denote the class of functions computable by a depth-d polynomial-size circuit of majority gates. We give a simple proof that POWm 6∈ L̂T2 for any m > 2. Specifically, we prove a 2Ω(n/ logn) lower bound on the size of any depth-2 majority circ...

متن کامل

A Lower Bound for Noncommutative Monotone Arithmetic Circuits

We consider arithmetic circuits over the semiring ((; min; concat) and show that such circuits require super-polynomial size to compute the lexicographically minimum perfect matching of a bipartite graph. By deening monotone analogues of optimization classes such as OptP, OptL and OptSAC 1 using the monotone analogues of their arithmetic circuit characterizations 13, 1], our lower bound implies...

متن کامل

Tighter Connections between Derandomization and Circuit Lower Bounds

We tighten the connections between circuit lower bounds and derandomization for each of the following three types of derandomization: general derandomization of promise-BPP (connected to Boolean circuits), derandomization of Polynomial Identity Testing (PIT) over fixed finite fields (connected to arithmetic circuit lower bounds over the same field), and derandomization of PIT over the integers ...

متن کامل

Small space analogues of Valiant's classes and the limitations of skew formula

In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relationship in Valiant’s algebraic model of computation, we propose width of an arithmetic circuit as a possible measure of space. We introduce the class VL as an algebraic variant of deterministic log-space L. In the uniform s...

متن کامل