Resource-Bounded Measure

We present a notion of resource-bounded measure for P and other subexponential-time classes. This generalization is based on Lutz's notion of measure, but overcomes the limitations that cause Lutz's de nitions to apply only to classes at least as large as E. We present many of the basic properties of this measure, and use it to explore the class of sets that are hard for BPP. Bennett and Gill showed that almost all sets are hard for BPP; Lutz improved this from Lebesgue measure to measure on ESPACE. We use our measure to improve this still further, showing that for all 0, almost every set in E is hard for BPP, where E = S DTIME2n ; which is the best that can be achieved without showing that BPP is properly contained in E. A number of related results are also obtained in this way.

• Type: Conference
• Year: 1998
• Where: COCO
• Authors: Jack H. Lutz
• Keywords: Algorithms, COCO 1998, Lutz's Notion, Resource-bounded Measure, Subexponential-time Classes