1. Lecture Notes in Computer Science;E. Allender,2005
2. Bauland, M., Böhler, E., Creignou, N., Reith, S., Schnoor, H., Vollmer, H.: Quantified constraints: The complexity of decision and counting for bounded alternation. Technical Report 05-025, Electronic Colloqium on Computational Complexity (Submitted for publication 2005)
3. Lecture Notes in Computer Science;F. Börner,2003
4. Lecture Notes in Computer Science;M. Bauland,2005
5. Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part I: Post’s lattice with applications to complexity theory. ACM-SIGACT Newsletter 34(4), 38–52 (2003)