Author:
Allender Eric,Jiao Jia,Mahajan Meena,Vinay V.
Subject
General Computer Science,Theoretical Computer Science
Reference57 articles.
1. On the isomorphism problem for weak reducibilities;Agrawal;J. Computer Sys. Sci.,1996
2. Proc. 9th Structure in Complexity Theory Conference;Agrawal,1994
3. On TC0, AC0, and arithmetic circuits;Agrawal,1997
4. P-uniform circuit complexity;Allender;J. ACM,1989
5. The complexity of computing maximal word functions;Allender;Comput. Complexity,1993
Cited by
62 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Lower Bounds for Arithmetic Circuits via the Hankel Matrix;computational complexity;2021-10-08
2. Cyclotomic Identity Testing and Applications;Proceedings of the 2021 on International Symposium on Symbolic and Algebraic Computation;2021-07-18
3. Balancing Straight-line Programs;Journal of the ACM;2021-06-30
4. Expressive Power of Linear Algebra Query Languages;Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2021-06-20
5. Uniform, Integral, and Feasible Proofs for the Determinant Identities;Journal of the ACM;2021-04-30