20 citations · 86 across the 15 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.LO2011★ 1 cited
A Simplest Undecidable Modal Logic
Edith Hemaspaandra, Henning Schnoor
Modal logics are widely used in computer science. The complexity of their satisfiability problems has been an active field of research since the 1970s. We prove that even very "sim…
cs.CC2011★ 7 cited
Minimization for Generalized Boolean Formulas
Edith Hemaspaandra, Henning Schnoor
The minimization problem for propositional formulas is an important optimization problem in the second level of the polynomial hierarchy. In general, the problem is Sigma-2-complet…