Author:
Buntrock Gerhard,Jenner Birgit,Lange Klaus-Jörn,Rossmanith Peter
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. C. Àlvarez and B. Jenner. A very hard log space counting class. In Proc. of 5th Conference on Structure in Complexity Theory, pages 154–168, 1990. (To appear in a Special Issue of Theoretical Computer Science).
2. E. W. Allender. The complexity of sparse sets in P. In Proc. of 1st Structure in Complexity Conf., number 223 in LNCS, pages 1–11. Springer, 1986.
3. J. Balcácar, J. Diáz, and J. Gabárro. Structural Complexity Theory I+II. Springer, 1988/1990.
4. G. Buntrock, C. Damm, U. Hertrampf, and C. Meinel. Structure and importance of logspace-MOD-classes. In Proc. of 7th STACS, To appear in LNCS. 1991.
5. G. Buntrock, L. A. Hemachandra, and D. Siefkes. Using inductive counting to simulate nondeterministic computation. In Proc. of 15th MFCS, number 452 in LNCS, pages 187–194. Springer, 1990. (to appear in Information and Computation).
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献