Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Lecture Notes in Computer Science;M. Bauland,2007
2. Beyersdorff, O., Meier, A., Thomas, M., Vollmer, H.: The complexity of propositional implication. ACM CoRR, arXiv:0811.0959v1 [cs.CC] (2008)
3. Lecture Notes in Computer Science;O. Beyersdorff,2009
4. Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part I: Post’s lattice with applications to complexity theory. SIGACT News 34(4), 38–52 (2003)
5. Buntrock, G., Damm, C., Hertrampf, U., Meinel, C.: Structure and importance of logspace MOD-classes. Mathematical Systems Theory 25, 223–237 (1992)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献