Author:
Arvind V.,Vijayaraghavan T. C.
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Arvind, V., Vijayaraghavan, T.C.: Abelian Permutation Group Problems and Logspace Counting Classes. In: IEEE Annual Conference on Computational Complexity (CCC 2004), pp. 204–214 (2004)
2. Allender, E., Beals, R., Ogihara, M.: The complexity of matrix rank and feasible systems of linear equations. Computational Complexity 8, 99–126 (1999)
3. Allender, E., Reinhardt, K., Zhou, S.: Isolation, matching, and counting: Uniform and nonuniform upper bounds. Journal of Computer and System Sciences 59, 164–181 (1999)
4. Buntrock, G., Damm, C., Hertrampf, U., Meinel, C.: Structure and Importance of Logspace-MOD Classes. Mathematical Systems Theory 25(3), 223–237 (1992)
5. Diophantine analysis;L.E. Dickson,1992
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献