• Corpus ID: 2059210

Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas

  title={Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas},
  author={G. Erd{\'e}lyi and Lane A. Hemaspaandra and J{\"o}rg Rothe and Holger Spakowski},
We prove that every distributional problem solvable in polynomial time on the average with respect to the uniform distribution has a frequently self-knowingly correct polynomial-time algorithm. We also study some features of probability weight of correctness with respect to generalizations of Procaccia and Rosenschein's junta distributions [PR07b]. 
Generalized juntas and NP-hard sets
Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
This work surveys and discusses some recent results on challenges to complexity results for manipulation and control, including typical-case analyses and experiments, fixed-parameter tractability, domain restrictions, and approximability.
Copeland Voting Fully Resists Constructive Control
It is proved that Copeland0.5, the system commonly referred to as "Copeland voting," provides full resistance to constructive control, among systems with a polynomial-time winner problem, this is the first natural election system proven to have full resistanceto constructive control.
Computational Aspects of Approval Voting 1
Since re-strategy preferencebased approval voting (SP-AV), a variant of approval voting propo sed by Brams and Sanver [BS06], is computationally resistant to 19 of the 22 common types of control, SP-AV is the system known to display the broadest resistance to control.
Computational Aspects of Approval Voting
“Yes, we can!” – Barack Obama’s campaign slogan inspired enough of his supporters to go to the polls and give him their “yes” votes that he won the 2008 U.S. presidential election. And this happened


On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
It is proved that every distributional problem solvable in polynomial time on the average with respect to the uniform distribution has a frequently self-knowingly correct polynometrictime algorithm.
The Complexity of Malign Measures
Lower and upper bounds are derived on the complexity of malign ensembles, which are tight for exponential time algorithms, and which show that no polynomial time computable malign ensemble exists for the class of polynometric time algorithms.
A personal view of average-case complexity
  • R. Impagliazzo
  • Computer Science, Mathematics
    Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference
  • 1995
The paper attempts to summarize the state of knowledge in this area, including some "folklore" results that have not explicitly appeared in print, and tries to standardize and unify definitions.
Average-case Complexity
The many open questions and the few things that are known about the average-case complexity of computational problems are reviewed, and a theory of completeness for distributional problems under reductions that preserveaverage-case tractability is initiated.
Average Case Complete Problems
  • L. Levin
  • Computer Science, Mathematics
    SIAM J. Comput.
  • 1986
It is shown in [1] that the Tiling problem with uniform distribution of instances has no polynominal “on average” algorithm, unless every NP-problem with every simple probability distribution has it.
Junta distributions and the average-case complexity of manipulating elections
It is demonstrated that NP-hard manipulations may be tractable in the average-case, and a family of important voting protocols is susceptible to manipulation by coalitions, when the number of candidates is constant.
Notes on Levin's Theory of Average-Case Complexity
This work provides an exposition of the basic definitions suggested by Leonid Levin, and discusses some of the considerations underlying these definitions.
On isomorphisms and density of NP and other complete sets
It is shown that complete sets in EXPTIME and EXPTAPE cannot be sparse and therefore they cannot be over a single letter alphabet, and the hardest context-sensitive languages cannot been sparse.
Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners
A simple greedy algorithm very frequently finds the Dodgson winners in such a way that it knows that it has found them, and furthermore the algorithm never incorrectly declares a nonwinner to be a winner.