The Quantitative Structure of Exponential Time

Recently Lutz [14,15] introduced a polynomial time bounded version of Lebesgue measure. He and others (see e.g. [11,13,14,15,16,17,18,20]) used this concept to investigate the quantitative structure of Exponential Time (E=DTIME (2lin )). Previously, Ambos-Spies, Fleischhack and Huwig [2,3] introduced polynomial time bounded genericity concepts and used them for the investigation of structural properties of NP (under appropriate assumptions) and E. Here we relate these concepts to each other. We show that, for any c≥1, the class of

• Type: Conference
• Year: 1993
• Where: COCO
• Authors: Jack H. Lutz
• Keywords: Algorithms, COCO 1993, Polynomial Time, Time Bounded Genericity, Time Bounded Version