Quantitative coding and complexity theory of \textit{continuous} data. I: Motivation, definition, consequences
From MaRDI portal
Publication:6854561
Cites work
- A new Characterization of Type-2 Feasibility
- A simple output-sensitive algorithm for hidden surface removal
- A tight bound on approximating arbitrary metrics by tree metrics
- Admissible representations of probability measures
- Admissibly Represented Spaces and Qcb-Spaces
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Approximation algorithms for embedding general metrics into trees
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
- Bounded time computation on metric spaces and Banach spaces
- Complexity theory for operators in analysis
- Complexity theory for spaces of integrable functions
- Complexity theory of (functions on) compact metric spaces
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Computational complexity of real functions
- Computational complexity on computable metric spaces
- Computational geometry. Algorithms and applications.
- Computing Haar Measures
- Computing over the reals: foundations for scientific computing.
- Equilogical spaces
- Extended admissibility.
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- Fast hierarchical clustering and other applications of dynamic closest pairs
- scientific article; zbMATH DE number 3112231 (Why is no real title available?)
- scientific article; zbMATH DE number 3147888 (Why is no real title available?)
- scientific article; zbMATH DE number 4199632 (Why is no real title available?)
- scientific article; zbMATH DE number 4023258 (Why is no real title available?)
- scientific article; zbMATH DE number 4101157 (Why is no real title available?)
- scientific article; zbMATH DE number 3745547 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 193625 (Why is no real title available?)
- scientific article; zbMATH DE number 3476270 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1746044 (Why is no real title available?)
- Kolmogorov Complexity Theory over the Reals
- Lp‐Computability
- Lipschitz and uniformly continuous reducibilities on ultrametric polish spaces
- Lipschitz continuous ordinary differential equations are polynomial-space complete
- Log space machines with multiple oracle tapes
- Logical Approaches to Computational Barriers
- Metric entropy and approximation
- On computable numbers, with an application to the Entscheidungsproblem.
- On computable numbers, with an application to the Entscheidungsproblem. A correction.
- On the definitions of computable real continuous functions
- On the topological aspects of the theory of represented spaces
- Parametrised second-order complexity theory with applications to the study of interval computation
- Polynomial and abstract subrecursive classes
- Quantitative coding and complexity theory of compact metric spaces
- Semantics, specification logic, and Hoare logic of exact real computation
- Small complexity classes for computable analysis
- Spaces allowing Type‐2 Complexity Theory revisited
- The computational complexity of maximization and integration
- Theory of representations
- Trees and ultrametric spaces: A categorical equivalence
- Uniform envelopes
This page was built for publication: Quantitative coding and complexity theory of \textit{continuous} data. I: Motivation, definition, consequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6854561)
