Author:
Agrawal Manindra,Allender Eric,Datta Samir
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference47 articles.
1. Bounded depth arithmetic circuits: Counting and closure;Allender,1999
2. Depth reduction for circuits of unbounded fan-in;Allender;Inform. and Comput.,1994
3. The complexity of matrix rank and feasible systems of linear equations;Allender,1996
4. A very hard log-space counting class;Álvarez;Theoret. Comput. Sci.,1993
5. Noncommutative arithmetic circuits: depth reduction and size lower bounds;Allender;Theoret. Comput. Sci.,1998
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献