Small spans in scaled dimension

SIAM Journal on Computing

Volumn 34, Issue 1, 2005, Pages 170-194

  Hitchcock, John M ^a  

^a UNIVERSITY OF WYOMING   (United States)

Author keywords

Polynomial time degrees; Resource bounded dimension; Small span theorems

Indexed keywords

POLYNOMIAL-TIME DEGREES; RESOURCE-BOUNDED DIMENSION; SMALL SPAN THEOREM;

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

THEOREM PROVING;

EID: 16244380485     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703426416     Document Type: Article

References (23)

1. K. AMBOS-SPIES, E. MAYORDOMO, AND X. ZHENG, A comparison of weak completeness notions, in Proceedings of the 11th IEEE Conference on Computational Complexity, Philadelphia, PA, IEEE Computer Society, Los Alamitos, CA, 1996, pp. 171-178.
2. 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, Chicago, IL, IEEE Computer Society, Los Alamitos, CA, 2001, pp. 210-217.
3. K. AMBOS-SPIES, H.-C. NEIS, AND S. A. TERWIJN, Genericity and measure for exponential time, Theoret. Comput. Sci., 168 (1996), pp. 3-19.
4. A with probability 1, SIAM J. Comput., 10 (1981), pp. 96-113.
5. R. V. BOOK, Comparing complexity classes, J. Comput. System Sci., 9 (1974), pp. 213-229.
6. H. BUHRMAN AND D. VAN MELKEBEEK, Hard sets are hard to find, J. Comput. System Sci., 59 (1999), pp. 327-345.
7. C. D. CUTLER, Strong and weak duality principles for fractal dimension in Euclidean space, Math. Proc. Cambridge Philos. Soc., 118 (1995), pp. 393-410.
8. K. FALCONER, Techniques in Fractal Geometry, John Wiley and Sons, Chichester, UK, 1997.
9. F. HAUSDORFF, Dimension und äußeres Maß, Math. Ann., 79 (1919), pp. 157-179.
10. J. M. HITCHCOCK, Fractal dimension and logarithmic loss unpredictability, Theoret. Comput. Sci., 304 (2003), pp. 431-441.
11. J. M. HITCHCOCK, J. H. LUTZ, AND E. MAYORDOMO, Scaled dimension and nonuniform complexity, J. Comput. System Sci., 69 (2004), pp. 97-122.
12. D. W. JUEDES AND J. H. LUTZ, The complexity and distribution of hard problems, SIAM J. Comput., 24 (1995), pp. 279-295.
13. 2, Theoret. Comput. Sci., 143 (1995), pp. 149-158.
14. W. LINDNER, On the Polynomial Time Bounded Measure of One-Truth-Table Degrees and P-Selectivity, Diplomarbeit, Technische Universität Berlin, Berlin, Germany, 1993.
15. J. H. LUTZ, An upward measure separation theorem, Theoret. Comput. Sci., 81 (1991), pp. 127-135.
16. J. H. LUTZ, Almost everywhere high nonuniform complexity, J. Comput. System Sci., 44 (1992), pp. 220-258.
17. J. H. LUTZ, A small span theorem for P/Poly-Turing reductions, in Proceedings of the 10th Annual Structure in Complexity Theory Conference, Minneapolis, MN, IEEE Computer Society, Los Alamitos, CA, 1995, pp. 324-330.
18. J. H. LUTZ, Dimension in complexity classes, SIAM J. Comput., 32 (2003), pp. 1236-1259.
19. J. H. LUTZ AND E. MAYORDOMO, Measure, stochasticity, and the density of hard languages, SIAM J. Comput., 23 (1994), pp. 762-779.
20. J. H. LUTZ AND E. MAYORDOMO, Cook versus Karp-Levin: Separating completeness notions if NP is not small, Theoret. Comput. Sci., 164 (1996), pp. 141-163.
21. E. MAYORDOMO, Almost every set in exponential time is P-bi-immune, Theoret. Comput. Sci., 136 (1994), pp. 487-506.
22. N. NISAN AND A. WIGDERSON, Hardness vs. randomness, J. Comput. System Sci., 49 (1994), pp. 149-167.
23. C. P. SCHNORR, A survey of the theory of random sequences, in Basic Problems in Methodology and Linguistics, Univ. Western Ontario Ser. Philos. Sci. 11, R. E. Butts and J. Hintikka, eds., Reidel, Dordrecht, The Netherlands, 1977, pp. 193-211.