Who Asked Us? How the Theory of Computing Answers Questions about Analysis
Authors:
- 21 February 2020
- book chapter
- Published by Springer Nature
- p. 48-56
Abstract
No abstract availableKeywords
All Related Versions
This publication has 38 references indexed in Scilit:
- Algorithmic Randomness and Complexity2010
- Effective Strong Dimension in Algorithmic Information and Computational ComplexitySIAM Journal on Computing, 2007
- The computational complexity of distance functions of two-dimensional domainsTheoretical Computer Science, 2005
- On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line PathsElectronic Notes in Theoretical Computer Science, 2005
- On the complexity of finding paths in a two-dimensional domain I: Shortest pathsMathematical Logic Quarterly, 2004
- Packing dimension and Cartesian productsTransactions of the American Mathematical Society, 1996
- Computational Complexity of Two-Dimensional RegionsSIAM Journal on Computing, 1995
- Two counterexamples concerning Hausdorff dimensions of projectionsColloquium Mathematicum, 1979
- Some remarks on the Kakeya problemMathematical Proceedings of the Cambridge Philosophical Society, 1971
- On Kakeya's problem and a similar oneMathematische Zeitschrift, 1928