2 search results - page 1 / 1 » Manipulation with Bounded Single-Peaked Width: A Parameteriz... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
ICALP
2010
Springer
13 years 7 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...