Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas
Computational Complexity
2008-06-17 v1 Computer Science and Game Theory
Multiagent Systems
Abstract
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].
Cite
@article{arxiv.0806.2555,
title = {Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas},
author = {Gabor Erdelyi and Lane A. Hemaspaandra and Joerg Rothe and Holger Spakowski},
journal= {arXiv preprint arXiv:0806.2555},
year = {2008}
}