2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/163007We 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].Computational ComplexityComputer Science and Game TheoryMultiagent SystemsF.1.3; F.2.2; I.2.11text