Author:
Hrubeš Pavel,Yehudayoff Amir
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference6 articles.
1. Some exact complexity results for straight-line computations over semirings;Jerrum;Journal of the ACM,1982
2. Elusive functions and lower bounds for arithmetic circuits;Raz,2008
3. On the depth complexity of formulas;Shamir;Journal Theory of Computing Systems,1979
4. Depth-3 arithmetic formulae over fields of characteristic zero;Shpilka;Journal of Computational Complexity,2001
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
2. Separating monotone VP and VNP;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23
3. Arithmetic Circuits: A survey of recent results and open questions;Foundations and Trends® in Theoretical Computer Science;2009