Author:
Buntrock Gerhard,Damm Carsten,Hertrampf Ulrich,Meinel Christoph
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference21 articles.
1. E. W. Allender. The complexity of sparse sets in P. InProc. 1st Structure in Complexity Conference, pp. 1?11. Lecture Notes in Computer Science, Vol. 223. Springer-Verlag, Berlin, 1986.
2. C. Àlvarez and B. Jenner. A very hard log space counting class. InProc. 5th Conference on Structure in Complexity Theory, pp. 154?168, 1990.
3. J. L. Balcácar, J. Diaz, and J. Gabarró.Structural Complexity Theory I. Springer-Verlag, New York, 1988.
4. R. Beigel, J. Gill, and U. Hertrampf. Counting classes: threshold, parity, mods, and fewness. InProc. 7th STACS, pp. 49?57. Lecture Notes in Computer Science, Vol. 415. Springer-Verlag, Berlin, 1990.
5. S. J. Berkowitz. On computing the determinant in small parallel time using a small number of processors.Inform. process. Lett., 18:147?150, 1984.
Cited by
75 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献