Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo  Home/Search
Context Related
| iastate.edu/~jhitchco/pape...esdaicc.ps iastate.edu/~lutz/=PAPERS/esdaicc.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iastate.edu/~jhitchco/bib/dim (more) Homepages: J.Hitchcock |
Rate this article:      (best)Comment on this article |
Abstract: The two most important notions of fractal dimension are Hausdorff dimension, developed by Hausdorff (1919), and packing dimension, developed independently by Tricot (1982) and Sullivan (1984). Both dimensions have the mathematical advantage of being defined from measures, and both have yielded extensive applications in fractal geometry and dynamical systems. Lutz (200) has recently proven... (Update)
Cited by: More
Scaled dimension and the Kolmogorov complexity of.. - Hitchcock.. (Correct)
Similar documents (at the sentence level):
6.6%: Effective Fractal Dimensions - Lutz (Correct)
Active bibliography (related documents): More All
2.7: The Arithmetical Complexity of Dimension and Randomness - Hitchcock, Lutz, Terwijn (2003) (Correct)
2.0: The Dimensions of Individual Strings and Sequences - Lutz (Correct)
1.0: The Frequency of Difficult Instances for MaxClique Approximation .. - Hitchcock (Correct)
Similar documents based on text: More All
1.2: Scaled Dimension and Nonuniform Complexity - Hitchcock, Lutz, Mayordomo (Correct)
1.0: Finite-State Dimension - Dai, Lathrop, Lutz, Mayordomo (2001) (Correct)
0.6: The Computational Complexity Column - Eric Allender Rutgers (1998) (Correct)
BibTeX entry: (Update)
K. B. Athreya, J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. Effective strong dimension in algorithmic information and computational complexity. In Proceedings of the Twenty--First Symposium on Theoretical Aspects of Computer Science, volume 2996 of Lecture Notes in Computer Science, pages 632--643. Springer-Verlag, 2004. http://citeseer.ist.psu.edu/athreya04effective.html More
@inproceedings{ athreya04effective,
author = "K. Athreya and J. Hitchcock and J. Lutz and E. Mayordomo",
title = "Effective strong dimension in algorithmic information and computational
complexity",
booktitle = "Proceedings of the Twenty--First Symposium on Theoretical Aspects of
Computer Science",
volume = "2996",
series = "Lecture Notes in Computer Science",
pages = "632--643",
publisher = "Springer-Verlag",
year = "2004",
url = "citeseer.ist.psu.edu/athreya04effective.html" }
Citations (may not include all citations):1447 A mathematical theory of communication (context) - Shannon - 1948
660 An Introduction to Kolmogorov Complexity and its Application.. - Li, Vitanyi - 1997
466 Probability and Measure (context) - Billingsley - 1995
152 Fractal Geometry: Mathematical Foundations and Applications (context) - Falconer - 1990
142 Almost everywhere high nonuniform complexity - Lutz - 1992
110 A theory of program size formally identical to information t.. - Chaitin - 1975
53 Techniques in Fractal Geometry (context) - Falconer - 1997
49 IEEE Transactions on Information Theory (context) - Ziv, for - 1978
47 Zufalligkeit und Wahrscheinlichkeit (context) - Schnorr - 1971
35 Etude Critique de la Notion de Collectif (context) - Ville - 1939
33 A unified approach to the definition of random sequences (context) - Schnorr - 1971
30 Resource-bounded measure (context) - Lutz - 1998
29 Theoretical Computer Science (context) - Dai, Lathrop et al.
27 The definition of random sequences (context) - Martin-Lof - 1966
27 Soviet Mathematics Doklady (context) - Vovk, criterion - 1987
20 A tight upper bound on Kolmogorov complexity and uniformly o.. (context) - Staiger - 1998
17 and limit sets of geometrically finite Kleinian groups (context) - Sullivan, Hausdor et al. - 1984
15 Noiseless coding of combinatorial sources (context) - Ya - 1986
15 Algorithmic approach to the prediction problem (context) - Ya - 1993
15 dimension in exponential time (context) - Ambos-Spies, Merkle et al. - 2001
14 Process complexity and e#ective random tests (context) - Schnorr - 1973
13 the equivalence of infinite product measures (context) - Kakutani - 1948
13 Resource bounded randomness and weakly complete problems (context) - Ambos-Spies, Terwijn et al. - 1997
12 Dimension und ausseres Mass (context) - Hausdor - 1919
12 Theorie de l'Addition des Variables Aleatoires (context) - Levy - 1937
10 ectiveness of prediction problems (context) - Ya, complexity - 1994
9 A Kolmogorov complexity characterization of constructive Hau.. - Mayordomo - 2002
9 Information and Computation (context) - Staiger, Hausdor - 1993
8 Fractal dimension and logarithmic loss unpredictability - Hitchcock
8 Department of Mathematics (context) - van Lambalgen, PhD - 1987
8 MAXSAT is exponentially hard to approximate if NP ha positiv.. - SAT, hard et al. - 2002
6 i and J. Hartmanis. On Hausdor# and topological dimensions o.. (context) - Ca - 1994
6 A survey of the theory of random sequences (context) - Schnorr - 1977
5 Measure and dimension functions: measurability and densities - Mattila, Mauldin - 1997
5 Mathematical Proceedings of the Cambridge Philosophical Soci.. (context) - Tricot, of - 1982
5 Equivalence of measures of complexity classes - Breutzmann, Lutz - 2000
5 Prediction and dimension - Fortnow, Lutz - 2002
5 Available as Technical Report cs (context) - Lutz, complexity et al.
5 How much can you win when your adversary is handicapped - Staiger - 2000
5 Available as Technical Report cs (context) - Lutz, of et al.
3 Correspondence principles for e#ective dimensions (context) - Hitchcock - 2002
3 A generalization of Chaitin's halting probability # and halt.. (context) - Tadaki - 2002
3 Coding of combinatorial sources and Hausdor# dimension (context) - Ya - 1984
3 Gales and supergales are equivalent for defining constructiv.. (context) - Fenner
3 Von Mises' definition of random sequences reconsidered - van Lambalgen - 1987
2 ective Hausdor# dimension (context) - Mayordomo
2 Information Processing Letters (context) - Hitchcock, ce et al.
Documents on the same site (http://www.cs.iastate.edu/~jhitchco/bib/dim.html): More
Small Spans in Scaled Dimension - Hitchcock (2004) (Correct)
The Dimensions of Individual Strings and Sequences - Lutz (Correct)
Complexity and Randomness - Terwijn (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC