The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of GatesElmar Böhler, Henning SchnoorTheory of Computing Systems2006Highly Influenced4 Excerpts

Generalized Modal SatisfiabilityEdith Hemaspaandra, Henning Schnoor, Ilka SchnoorJ. Comput. Syst. Sci.2010

The complexity of satisfiability problems: Refining Schaefer's theoremEric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert VollmerJ. Comput. Syst. Sci.2009

The tractability of model checking for LTL: The good, the bad, and the ugly fragmentsMichael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert VollmerACM Trans. Comput. Log.20082 Excerpts

Boolean Functions and Post ’ s Lattice with Applications to Complexity Theory Lecture Notes for Logic and Interaction 2002Elmar Böhler, Heribert Vollmer2007

The Complexity of Generalized Satisfiability for Linear Temporal LogicMichael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert VollmerElectronic Colloquium on Computational Complexity2006

Introduction to Circuit ComplexityHeribert VollmerTexts in Theoretical Computer Science An EATCS…1999