Affiliation:
1. Microsoft Research, India
2. Chennai Mathematical Institute, Cambridge, MA
Abstract
Agrawal and Vinay [2008], Koiran [2012], and Tavenas [2013] have recently shown that an exp (ω(√
n
log
n
)) lower bound for depth four homogeneous circuits computing the permanent with bottom layer of × gates having fanin bounded by √n translates to a superpolynomial lower bound for general arithmetic circuits computing the permanent. Motivated by this, we examine the complexity of computing the permanent and determinant via such homogeneous depth four circuits with bounded bottom fanin.
We show here that any homogeneous depth four arithmetic circuit with bottom fanin bounded by √n computing the permanent (or the determinant) must be of size exp,(Ω(√
n
)).
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On the Power of Homogeneous Algebraic Formulas;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits;Communications of the ACM;2024-01-25
3. Guest Column;ACM SIGACT News;2022-06-10
4. Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
5. Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02