A quadratic lower bound for homogeneous algebraic branching programs-Reference-Cited by-同舟云学术

A quadratic lower bound for homogeneous algebraic branching programs

Published:2019-06-08 Issue:3 Volume:28 Page:409-435
ISSN:1016-3328
Container-title:computational complexity
language:en
Short-container-title:comput. complex.

Author:

Kumar Mrinal

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00037-019-00186-3.pdf

Reference18 articles.

1. Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka & Ben Lee Volk (2016). Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. In CCC 2016, 30:1–30:25. URL http://dx.doi.org/10.4230/LIPIcs.CCC.2016.30 .

2. Walter Baur & Volker Strassen: The Complexity of Partial Derivatives. Theoretical Computer Science 22, 317–330 (1983)

3. Eli Ben-Sasson & Swastik Kopparty (2012). Affine Dispersers from Subspace Polynomials. SIAM J. Comput. 41(4), 880–914. URL http://dx.doi.org/10.1137/110826254 .

4. Jin-yi Cai, Xi Chen & Dong Li (2010). Quadratic Lower Bound for Permanent Vs. Determinant in any Characteristic. Computational Complexity 19(1), 37–56. URL http://dx.doi.org/10.1007/s00037-009-0284-2 .

5. David A. Cox, John B. Little & Donal O'Shea (2007). Ideals, Varieties and Algorithms. Undergraduate texts in mathematics. Springer.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Determinants vs. Algebraic Branching Programs;computational complexity;2024-08-31

2. Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply $$\text{VP} \neq \text{VNP}$$;computational complexity;2024-04-16

3. A Lower Bound on Determinantal Complexity;computational complexity;2022-09-19

4. Quadratic Lower Bounds for Algebraic Branching Programs and Formulas;computational complexity;2022-07-05

5. Limitations of Sums of Bounded Read Formulas and ABPs;Computer Science – Theory and Applications;2021