Arithmetic Circuits with Locally Low Algebraic Rank
نویسندگان
چکیده
In recent years there has been a flurry of activity proving lower bounds for homogeneous depth-4 arithmetic circuits [GKKS13, FLMS14, KLSS14, KS14c], which has brought us very close to statements that are known to imply VP 6= VNP. It is a big question to go beyond homogeneity, and in this paper we make progress towards this by considering depth-4 circuits of low algebraic rank, which are a natural extension of homogeneous depth-4 arithmetic circuits. A depth-4 circuit is a representation of an N -variate, degree n polynomial P as
منابع مشابه
Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits
The motivation for this work comes from two problems– test algebraic independence of arithmetic circuits over a field of small characteristic, and generalize the structural property of algebraic dependence used by (Kumar, Saraf CCC’16) to arbitrary fields. It is known that in the case of zero, or large characteristic, using a classical criterion based on the Jacobian, we get a randomized poly-t...
متن کاملAlgebraic Independence over Positive 1 Characteristic : New Criterion and Applications
The motivation for this work comes from two problems– test algebraic independence 5 of arithmetic circuits over a field of small characteristic, and generalize the structural property of 6 algebraic dependence used by (Kumar, Saraf, CCC’16) to arbitrary fields. 7 It is known that in the case of zero, or large characteristic, using a classical criterion based on 8 the Jacobian, we get a randomiz...
متن کاملIntroduction to arithmetic groups
Arithmetic groups are fundamental groups of locally symmetric spaces. We will see how they are constructed, and discuss some of their important properties. For example, although the Q-rank of an arithmetic group is usually defined in purely algebraic terms, we will see that it provides important information about the geometry and topology of the corresponding locally symmetric space. Algebraic ...
متن کاملTight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees
This paper studies lower bounds for arithmetic circuits computing (non-commutative) polynomials. Our conceptual contribution is an exact correspondence between circuits and weighted automata: algebraic branching programs are captured by weighted automata over words, and circuits with unique parse trees by weighted automata over trees. The key notion for understanding the minimisation question o...
متن کاملLearning Restricted Models of Arithmetic Circuits
We present a polynomial time algorithm for learning a large class of algebraic models of computation. We show that any arithmetic circuit whose partial derivatives induce a low-dimensional vector space is exactly learnable from membership and equivalence queries. As a consequence, we obtain polynomial-time algorithms for learning restricted algebraic branching programs as well as noncommutative...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 22 شماره
صفحات -
تاریخ انتشار 2015