Generalized juntas and NP-hard sets
From MaRDI portal
Publication:837194
DOI10.1016/J.TCS.2009.06.026zbMATH Open1171.68012OpenAlexW2041316638MaRDI QIDQ837194FDOQ837194
Holger Spakowski, Lane A. Hemaspaandra, Gábor Erdélyi, Jörg Rothe
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
Cites Work
- On Isomorphisms and Density of $NP$ and Other Complete Sets
- How hard is it to control an election?
- Average Case Complete Problems
- Average case complexity under the universal distribution equals worst- case complexity
- Notes on Levin’s Theory of Average-Case Complexity
- The Complexity of Malign Measures
- Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Control complexity in Bucklin and fallback voting: an experimental analysis
- The complexity of manipulative attacks in nearly single-peaked electorates
- The opacity of backbones
- Computational Aspects of Approval Voting
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
- Normalized range voting broadly resists control
This page was built for publication: Generalized juntas and NP-hard sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q837194)
