5 papers
The Complexity of Boolean Constraint Isomorphism
Elmar Böhler, Edith Hemaspaandra, Steffen Reith +1
In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems (nowadays usua…
Equivalence and Isomorphism for Boolean Constraint Satisfaction
E. Boehler, E. Hemaspaandra, Steffen Reith +1
A Boolean constraint satisfaction instance is a conjunction of constraint applications, where the allowed constraints are drawn from a fixed set B of Boolean functions. We consider…
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
Steffen Reith, Heribert Vollmer
We consider the problems of finding the lexicographically minimal (or maximal) satisfying assignment of propositional formulae for different restricted formula classes. It turns ou…
A Generalized Quantifier Concept in Computational Complexity Theory
Heribert Vollmer
A notion of generalized quantifier in computational complexity theory is explored and used to give a unified treatment of leaf language definability, oracle separations, type 2 ope…
The descriptive complexity approach to LOGCFL
Clemens Lautemann, Pierre McKenzie, Thomas Schwentick +1
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclasses o…