Hausdorff dimension in exponential time

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2001, Pages 210-217

  Ambos Spies, K ^a   Merkle, W ^a   Reimann, J ^a   Stephan, F ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; COMPUTABILITY AND DECIDABILITY; CONFORMAL MAPPING; GAME THEORY; POLYNOMIALS; RECURSIVE FUNCTIONS; SET THEORY; THEOREM PROVING;

BINARY ENTROPY FUNCTION; EXPONENTIAL TIME; GENERAL INVARIANCE THEOREM; HAUSDORFF DIMENSION; RESOURCE BOUNDED DIMENSION;

COMPUTATIONAL COMPLEXITY;

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

References (22)

1. Resource-bounded measure and randomness
2. Resource-bounded balanced genericity, stochasticity and weak randomness
3. Resource bounded randomness and weakly complete problems
4. A generalization of resource-bounded measure, with application to the BPP vs. EXP problem
5. On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
6. Dimension und äußeres Maß. Math. Ann.
7. The complexity and distribution of hard problems
8. On the notion of infinite pseudorandom sequences
9. Weakly hard problems
10. The quantitative structure of exponential time
11. Dimension in complexity classes
12. Gales and the constructive dimension of individual sequences
13. Almost every set in exponential time is P-bi-immune
14. Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
15. Algorithmic approach to the prediction problem
16. The complexity and effectiveness of prediction algorithms
17. Kolmogorov complexity and Hausdorff dimension
18. A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
19. How much can you win when your adversary is handicapped?