Author:
Kayal Neeraj,Nair Vineet,Saha Chandan
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference65 articles.
1. Agrawal, Manindra, V. Vinay (2008). Arithmetic Circuits: A Chasm at Depth Four. In
2. 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008(October), pp. 25-28, : Philadelphia, pp. 67-75. PA, USA (2008)
3. Eric Allender & Shuichi Hirahara (2017). New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems. In 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS: August 21–25, 2017 - Aalborg. Denmark 54(1–54), 14 (2017)
4. László Babai & Lajos Rónyai: Computing Irreducible Representations of Finite Groups. Mathematics of Computation 55(192), 705–722 (1990)
5. Michael Ben-Or & Richard Cleve: Computing Algebraic Formulas Using a Constant Number of Registers. SIAM J. Comput. 21(1), 54–58 (1992)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Learning sums of powers of low-degree polynomials in the non-degenerate case;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11
2. Implementing geometric complexity theory: on the separation of orbit closures via symmetries;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06