| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428050 | Information Processing Letters | 2009 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
