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

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

2008-06-16

arxiv.org/abs/0806.2555v1

Computer Science

Computational Complexity

Scientific paper

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].

Affiliated with

Also associated with

No associations

Rating

Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-91880