Author:
Blondin Michael,McKenzie Pierre
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Allender, E., Beals, R., Ogihara, M.: The complexity of matrix rank and feasible systems of linear equations. Comput. Complex. 8(2), 99–126 (1999)
2. Arvind, V., Vijayaraghavan, T.C.: Classifying problems on linear congruences and abelian permutation groups using logspace counting classes. Comput. Complex. 19, 57–98 (2010)
3. Lecture Notes in Computer Science;S. Bala,2002
4. Buntrock, G., Damm, C., Hertrampf, U., Meinel, C.: Structure and importance of logspace-mod class. Theory of Computing Systems 25, 223–237 (1992)
5. Beaudry, M.: Membership testing in commutative transformation semigroups. Information and Computation 79(1), 84–93 (1988)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献