Average case complete problems
SIAM Journal on Computing
Average case complexity under the universal distribution equals worst-case complexity
Information Processing Letters
The complexity of malign measures
SIAM Journal on Computing
Average-case computational complexity theory
Complexity theory retrospective II
A personal view of average-case complexity
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Junta distributions and the average-case complexity of manipulating elections
Journal of Artificial Intelligence Research
Guarantees for the success frequency of an algorithm for finding dodgson-election winners
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
How hard is it to control an election?
Mathematical and Computer Modelling: An International Journal
How hard is bribery in elections?
Journal of Artificial Intelligence Research
Using complexity to protect elections
Communications of the ACM
The complexity of manipulative attacks in nearly single-peaked electorates
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Bribery in path-disruption games
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Where are the hard manipulation problems?
Journal of Artificial Intelligence Research
Normalized Range Voting Broadly Resists Control
Theory of Computing Systems
The complexity of manipulative attacks in nearly single-peaked electorates
Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
| Hi-index | 5.24 |
We show that many NP-hard sets have heuristic polynomial-time algorithms with high probability weight of correctness with respect to generalizations of Procaccia and Rosenschein's junta distributions.