Small spans in scaled dimension

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 19, Issue , 2004, Pages 104-112

  Hitchcock, John M ^a  

^a UNIVERSITY OF WYOMING   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY CLASSES; EXPONENTIAL SPACE; SCALED DIMENSION;

MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

COMPUTATIONAL COMPLEXITY;

EID: 4944251666     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. K. Ambos-Spies, W. Merkle, J. Reimann, and F. Stephan, Hausdorff dimension in exponential time. In Proceedings of the 16th IEEE Conference on Computational Complexity, pages 210-217. IEEE Computer Society, 2001.
2. K. Ambos-Spies, H.-C. Neis, and S. A. Terwijn. Genericity and measure for exponential time. Theoretical Computer Science, 168(1):3-19, 1996.
3. A with probability 1. SIAM Journal on Computing, 10:96-113, 1981.
4. R. V. Book. Comparing complexity classes. Journal of Computer and System Sciences, 9:213-229, 1974.
5. H. Buhrman and D. van Melkebeek. Hard sets are hard to find. Journal of Computer and System Sciences, 59(2):327-345, 1999.
6. F. Hausdorff. Dimension und äußeres Maß. Mathematische Annalen, 79:157-179, 1919.
7. J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. Scaled dimension and nonuniform complexity. Journal of Computer and System Sciences. To appear.
8. D. W. Juedes and J. H. Lutz. The complexity and distribution of hard problems. SIAM Journal on Computing, 24(2):279-295, 1995.
9. W. Lindner. On the polynomial time bounded measure of one-truth-table degrees and p-selectivity. Diplomarbeit, Technische Universität Berlin, 1993.
10. J. H. Lutz. An upward measure separation theorem. Theoretical Computer Science, 81(1): 127-135, 1991.
11. J. H. Lutz. Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences, 44(2):220-258, 1992.
12. J. H. Lutz. A small span theorem for P/Poly-Turing reductions. In Proceedings of the Tenth Annual Structure in Complexity Theory Conference, pages 324-330. IEEE Computer Society, 1995.
13. J. H. Lutz. Dimension in complexity classes. SIAM Journal on Computing, 32(5): 1236-1250, 2003.
14. J. H. Lutz and E. Mayordomo. Measure, stochasticity, and the density of hard languages. SIAM Journal on Computing, 23(4):762-779, 1994.
15. J. H. Lutz and E. Mayordomo. Cook versus Karp-Levin: Separating completeness notions if NP is not small. Theoretical Computer Science, 164(1-2): 141-163, 1996.
16. E. Mayordomo. Almost every set in exponential time is P-bi-immune. Theoretical Computer Science, 136(2):487-506, 1994.
17. N. Nisan and A. Wigderson. Hardness vs randomness. Journal of Computer and System Sciences, 49:149-167, 1994.