Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference22 articles.
1. On the isomorphism problem for weak reducibilities;Agrawal;J. Comput. System Sci.,1996
2. M. Agrawal, E. Allender, An isomorphism theorem for circuit complexity, Proc. 11th Conference on Computational Complexity, 1996, 2, 11
3. M. Agrawal, S. Biswas, Polynomial isomorphism of 1-L-complete sets, Proc. 8th Structure in Complexity Theory Conference, 1993, 75, 80
4. Isomorphisms and 1-L reductions;Allender;J. Comput. System Sci.,1988
5. L. Berman, 1977, Polynomial Reducibilities and Complete Sets, Cornell University
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献