Author:
Arvind V.,Köbler Johannes
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Allender, E.: Arithmetic Circuits and Counting Complexity Classes. In: Krajicek, J., di Matematica, Q. (eds.) Complexity of Computations and Proofs. Seconda Universita di Napoli, vol. 13, pp. 33–72 (2004)
2. Allender, E., Ogihara, M.: Relationships among PL, #L and the determinant. RAIRO - Theoretical Informatics and Applications 30(1), 1–21 (1996)
3. Àlvarez, C., Jenner, B.: A Very Hard log-Space Counting Class. Theoretical Computer Science 107(1), 3–30 (1993)
4. Lecture Notes in Computer Science;V. Arvind,2006
5. Lecture Notes in Computer Science;V. Arvind,2006
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献