Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1007/11780342_37guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Two open problems on effective dimension

Published: 30 June 2006 Publication History
  • Get Citation Alerts
  • Abstract

    Effective fractal dimension was defined by Lutz [13]in order to quantitatively analyze the structure of complexity classes. The dimension of a class X inside a base class ${\mathcal{C}}$ is a real number in [0,1] corresponding to the relative size of $X \cap \mathcal{C}$ inside $\mathcal{C}$. Basic properties include monotonicity, so dimension 1 classes are maximal and dimension 0 ones are minimal, and the fact that dimension is defined for every classX, making effective dimension a precise quantitative tool.

    References

    [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, 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]
    K. B. Athreya, J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. Effective strong dimension in algorithmic information and computational complexity. SIAM Journal on Computing. To appear.
    [4]
    H. Buhrman and D. van Melkebeek. Hard sets are hard to find. Journal of Computer and System Sciences, 59(2):327-345, 1999.
    [5]
    K. Falconer. The Geometry of Fractal Sets. Cambridge University Press, 1985.
    [6]
    K. Falconer. Fractal Geometry: Mathematical Foundations and Applications. John Wiley & sons, 2003.
    [7]
    K. Falconer. Techniques in Fractal Geometry. John Wiley & sons, 2003.
    [8]
    J. M. Hitchcock. Small spans in scaled dimension. SIAM Journal on Computing, 34:170-194, 2004.
    [9]
    J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. Scaled dimension and nonuniform complexity. Journal of Computer and System Sciences, 69:97-122, 2004.
    [10]
    J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. The fractal geometry of complexity classes. SIGACT News Complexity Theory Column, 36:24-38, 2005.
    [11]
    J. M. Hitchcock, A. Pavan, and N. V. Vinodchandran. Partial bi-immunity, scaled dimension, and NP-completeness. Theory of Computing Systems. To appear.
    [12]
    D. W. Juedes and J. H. Lutz. The complexity and distribution of hard problems. SIAM Journal on Computing, 24(2):279-295, 1995.
    [13]
    J. H. Lutz. Dimension in complexity classes. SIAM Journal on Computing, 32:1236-1259, 2003.
    [14]
    J. H. Lutz. The dimensions of individual strings and sequences. Information and Computation, 187:49-79, 2003.
    [15]
    J. H. Lutz. Effective fractal dimensions. Mathematical Logic Quarterly, 51:62-72, 2005.
    [16]
    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.
    [17]
    J. H. Lutz and E. Mayordomo. Twelve problems in resource-bounded measure. In G. Paun, G. Rozenberg, and A. Salomaa, editors, Current Trends in Theoretical Computer Science: Entering the 21st Century, pages 83-101. World Scientific, 2001.
    [18]
    D. Sullivan. Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups. Acta Mathematica, 153:259-277, 1984.
    [19]
    C. Tricot. Two definitions of fractional dimension. Mathematical Proceedings of the Cambridge Philosophical Society, 91:57-74, 1982.

    Index Terms

    1. Two open problems on effective dimension
      Index terms have been assigned to the content through auto-classification.

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image Guide Proceedings
      CiE'06: Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
      June 2006
      606 pages
      ISBN:3540354662
      • Editors:
      • Arnold Beckmann,
      • Ulrich Berger,
      • Benedikt Löwe,
      • John V. Tucker

      Publisher

      Springer-Verlag

      Berlin, Heidelberg

      Publication History

      Published: 30 June 2006

      Qualifiers

      • Article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 0
        Total Downloads
      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 10 Aug 2024

      Other Metrics

      Citations

      View Options

      View options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media