Multi-k-ic Depth Three Circuit Lower Bound-Reference-Cited by-同舟云学术

Multi-k-ic Depth Three Circuit Lower Bound

Published:2016-12-13 Issue:4 Volume:61 Page:1237-1251
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Kayal Neeraj,Saha Chandan

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/article/10.1007/s00224-016-9742-9/fulltext.html

Reference21 articles.

1. Agrawal, M., Saha, C., Saptharishi, R., Saxena, N.: Jacobian Hits Circuits: Hitting-Sets, Lower Bounds for Depth-D Occur-K Formulas & Depth-3 Transcendence Degree-K Circuits. In: STOC, pp. 599–614 (2012)

2. Agrawal, M., Vinay, V.: Arithmetic Circuits: A Chasm at Depth Four. In: FOCS, pp. 67–75 (2008)

3. Forbes, M. A.: Shpilka, A.: Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs. In: 54Th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pp. 243–252 (2013)

4. Grenet, B., Koiran, P., Portier, N., Strozecki, Y.: The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent. In: Proceedings of the 30Th Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Pp. 127–139 (2011)

5. Grigoriev, D., Karpinski, M.: An Exponential Lower Bound for Depth 3 Arithmetic Circuits. In: STOC, pp. 577–582 (1998)

Cited by 5 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. Lower Bounds for the Sum of Small-Size Algebraic Branching Programs;Lecture Notes in Computer Science;2024

3. On Computing Multilinear Polynomials Using Multi- r -ic Depth Four Circuits;ACM Transactions on Computation Theory;2021-09-30

4. On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits;LEIBNIZ INT PR INFOR;2020

5. On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree;Theory of Computing;2018