Genericity and Measure for Exponential Time

@inproceedings{AmbosSpies1994GenericityAM,
  title={Genericity and Measure for Exponential Time},
  author={Klaus Ambos-Spies and Hans-Christian Neis and Sebastiaan Terwijn},
  booktitle={MFCS},
  year={1994}
}
Recently, Lutz [14, 151 introduced a polynomial time bounded version of Lebesgue measure. He and others (see e.g. [ 11, 13-18,201) used this concept to investigate the quantitative structure of Exponential Time (E = DTIME(2”“)). Previously, Ambos-Spies et al. [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 3 1… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 41 extracted citations

Hard Sets Are Hard to Find

J. Comput. Syst. Sci. • 1999
View 5 Excerpts
Highly Influenced

Genericity, Randomness, and Polynomial-Time Approximations

SIAM J. Comput. • 1998
View 9 Excerpts
Highly Influenced

A Small Span Theorem for P/Poly-Turing Reductions

Structure in Complexity Theory Conference • 1995
View 8 Excerpts
Highly Influenced

Twelve Problems in Resource-Bounded Measure

Current Trends in Theoretical Computer Science • 1999
View 8 Excerpts
Highly Influenced

Resource Bounded Randomness andWeakly Complete Problems 1

- KlausAmbos, SpiesUniversit
1997
View 11 Excerpts
Highly Influenced

Resource Bounded Randomness and Weakly Complete Problems 1

Klaus Ambos-SpiesUniversit
1994
View 11 Excerpts
Highly Influenced

SIGACT news complexity theory column 48

SIGACT News • 2005
View 4 Excerpts
Highly Influenced

Small spans in scaled dimension

Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004. • 2004
View 2 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 20 references

versus Karp-Levin: Separating completeness notions if NP is not small

J. H. Lutz, E. Mayordomo, Cook
Theoret. Comput. Sci • 1996

On the polynomial time bounded measure of one-truth-table degrees and p-selectivity, Diplomarbeit

W. Lindner
Technische Universitiit Berlin, • 1993

The Quantitative Structure of Exponential Time

Structure in Complexity Theory Conference • 1993

Almost Everywhere High Nonuniform Complexity

Structure in Complexity Theory Conference • 1989

Similar Papers

Loading similar papers…