20 citations · 86 across the 15 of their papers we have counts for
3 papers · 1 filter
Llull and Copeland Voting Computationally Resist Bribery and Control
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra +1
The only systems previously known to be resistant to all the standard control types were highly artificial election systems created by hybridization. We study a parameterized versi…
Generalized Modal Satisfiability
Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
It is well known that modal satisfiability is PSPACE-complete (Ladner 1977). However, the complexity may decrease if we restrict the set of propositional operators used. Note that…
On the Complexity of Elementary Modal Logics
Edith Hemaspaandra, Henning Schnoor
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b…