Generalized juntas and NP-hard sets-Reference-Cited by-同舟云学术

Generalized juntas and NP-hard sets

Published:2009-09 Issue:38-40 Volume:410 Page:3995-4000
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Erdélyi Gábor,Hemaspaandra Lane A.,Rothe Jörg,Spakowski Holger

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference17 articles.

1. On isomorphisms and density of NP and other complete sets;Berman;SIAM Journal on Computing,1977

2. Average-Case Complexity;Bogdanov,2006

3. How hard is it to control an election?;Bartholdi;Mathematical and Computer Modelling,1992

4. G. Erdélyi, L. Hemaspaandra, J. Rothe, H. Spakowski, Frequency of correctness versus average-case polynomial time and generalized juntas, Technical Report TR-934, Department of Computer Science, University of Rochester, Rochester, NY, June 2008

5. O. Goldreich, Notes on Levin’s theory of average-case complexity, Technical Report TR97-058, Electronic Colloquium on Computational Complexity, November 1997

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The opacity of backbones;Information and Computation;2021-12

2. Control complexity in Bucklin and fallback voting: An experimental analysis;Journal of Computer and System Sciences;2015-06

3. The complexity of manipulative attacks in nearly single-peaked electorates;Artificial Intelligence;2014-02

4. Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey;Annals of Mathematics and Artificial Intelligence;2013-06-08

5. Normalized Range Voting Broadly Resists Control;Theory of Computing Systems;2012-12-21