Author:
Agrawal Manindra,Allender Eric,Rudich Steven
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference37 articles.
1. On the isomorphism problem for weak reducibilities;Agrawal;J. Comput. System Sci.,1996
2. DSPACEn[formula]n;Agrawal;J. Comput. System Sci.,1997
3. M. Agrawal, For completeness, sublogarithmic space is no space
4. M. Agrawal, E. Allender, An isomorphism theorem for circuit complexity, Proc. 11th Annual IEEE Conference on Computational Complexity, 1996, 2, 11
5. M. Agrawal, E. Allender, R. Impagliazzo, T. Pitassi, S. Rudich, Reducing the complexity of reductions, Proc. 29th ACM Symposium on Theory of Computing, 1997, 730, 738
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献