Frequency of correctness versus average polynomial time

  • Authors:

  • Gábor Erdélyi;Lane A. Hemaspaandra;Jörg Rothe;Holger Spakowski

  • Affiliations:

  • Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, 40225 Düsseldorf, Germany;Department of Computer Science, University of Rochester, Rochester, NY 14627, USA;Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, 40225 Düsseldorf, Germany;Department of Mathematics & Applied Mathematics, University of Cape Town, Rondebosch 7701, South Africa

  • Venue:
  • Information Processing Letters
  • Year:
  • 2009

Quantified Score

Hi-index 0.89

Visualization

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.