scientific article; zbMATH DE number 7378388
From MaRDI portal
Publication:5005175
DOI10.4230/LIPIcs.MFCS.2018.71MaRDI QIDQ5005175
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1711.02124
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
Extending the reach of the point-to-set principle ⋮ Dimension and the structure of complexity classes ⋮ Who Asked Us? How the Theory of Computing Answers Questions about Analysis ⋮ Combinatorial proofs of two theorems of Lutz and Stull ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Correspondence principles for effective dimensions
- Algorithmically independent sequences
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- Bounding the dimension of points on a line
- On the packing dimension and category of exceptional sets of orthogonal projections
- Box and packing dimensions of projections and dimension profiles
- Sixty Years of Fractal Projections
- Fractals in Probability and Analysis
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- Dimensions of Points in Self-Similar Fractals
- Two counterexamples concerning Hausdorff dimensions of projections
- Hausdorff dimension, orthogonal projections and intersections with planes
- Packing dimensions of projections and dimension profiles
- Dimension in Complexity Classes
- The packing dimension of projections and sections of measures
- Projection theorems for box and packing dimensions
- Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
- Fractal Intersections and Products via Algorithmic Dimension
- Recent Progress on Dimensions of Projections
- On Hausdorff dimension of projections
- Some Fundamental Geometrical Properties of Plane Sets of Fractional Dimensions
- An introduction to Kolmogorov complexity and its applications
This page was built for publication:
