2000 character limit reached
Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas (0806.2555v1)
Published 16 Jun 2008 in cs.CC, cs.GT, and cs.MA
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].
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.