Generalized juntas and NP-hard sets
From MaRDI portal
Publication:837194
DOI10.1016/j.tcs.2009.06.026zbMath1171.68012OpenAlexW2041316638MaRDI QIDQ837194
Holger Spakowski, Gábor Erdélyi, Jörg Rothe, Hemaspaandra, Lane A.
Publication date: 10 September 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.026
Related Items (6)
Normalized range voting broadly resists control ⋮ Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey ⋮ The complexity of manipulative attacks in nearly single-peaked electorates ⋮ Control complexity in Bucklin and fallback voting: an experimental analysis ⋮ The opacity of backbones ⋮ Computational Aspects of Approval Voting
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners
- Average case complexity under the universal distribution equals worst- case complexity
- How hard is it to control an election?
- Notes on Levin’s Theory of Average-Case Complexity
- Average Case Complete Problems
- The Complexity of Malign Measures
- On Isomorphisms and Density of $NP$ and Other Complete Sets
- Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners
This page was built for publication: Generalized juntas and NP-hard sets
