Average-Case Computations — Comparing AvgP, HP, and Nearly-P

Abstract

We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in [4] using polynomial-time algorithm schemes with benign faults. The class HP [4]