Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Lower bounds for non-commutative computation
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Computing algebraic formulas using a constant number of registers
SIAM Journal on Computing
Bounded-width polynomial-size Boolean formulas compute exactly those functions in AC0
Information Processing Letters
On lower bounds for read-k-times branching programs
Computational Complexity
Lower bounds on arithmetic circuits via partial derivatives
Computational Complexity
Nondeterministic NC1 computation
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Bounded Depth Arithmetic Circuits: Counting and Closure
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Hierarchies of Circuit Classes that are Closed Under Complement
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Deterministic CFL's are accepted simultaneously in polynomial time and log squared space
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The Complexity of Polynomials and Their Coefficient Functions
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Characterizing Valiant's algebraic complexity classes
Journal of Complexity
Expressing a fraction of two determinants as a determinant
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Balancing Syntactically Multilinear Arithmetic Circuits
Computational Complexity
Multi-linear formulas for permanent and determinant are of super-polynomial size
Journal of the ACM (JACM)
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
SIAM Journal on Computing
Arithmetizing classes around NC1and L
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Hi-index | 0.00 |
The class of polynomials computable by polynomial size log-depth arithmetic circuits (VNC 1) is known to be computable by constant width polynomial degree circuits (VsSC 0), but whether the converse containment holds is an open problem. As a partial answer to this question, we give a construction which shows that syntactically multilinear circuits of constant width and polynomial degree can be depth-reduced, which in our notation shows that sm-VsSC 0 $${\subseteq}$$ 驴 sm-VNC 1. We further strengthen this inclusion, by giving a separate construction that provides a width-efficient simulation for constant width syntactically multilinear circuits by constant width syntactically multilinear algebraic branching programs; in our notation, sm-VsSC 0 $${\subseteq}$$ 驴 sm-VBWBP. We then focus on polynomial size syntactically multilinear circuits and study relationships between classes of functions obtained by imposing various resource (width, depth, degree) restrictions on these circuits. Along the way, we also observe a characterization of the class NC 1 in terms of a restricted class of planar branching programs of polynomial size. Finally, in contrast to the general case, we report closure and stability of coefficient functions for the syntactically multilinear classes studied in this paper.