Computer Science for Continuous Data
From MaRDI portal
Publication:6487409
DOI10.1007/978-3-031-14788-3_5zbMath1514.68322MaRDI QIDQ6487409
Martin Ziegler, Franz Brauße, Peter J. Collins
Publication date: 21 December 2022
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Lipschitz continuous ordinary differential equations are polynomial-space complete
- Computability in linear algebra
- Exact real computation of solution operators for linear analytic systems of partial differential equations
- Quantifier elimination for the reals with a predicate for the powers of two
- The computational complexity of maximization and integration
- Solutions in \(L_ r\) of the Navier-Stokes initial value problem
- Theory of representations
- The field of reals with a predicate for the powers of two
- The wave equation with computable initial data such that its unique solution is not computable
- The maximum value problem and NP real numbers
- Computational complexity of real functions
- A fundamental effect in computations on real numbers
- Feasible real random access machines
- Computing periods
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- Verified compilation of floating-point computations
- Topological complexity with continuous operations
- On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1$$]
- Computability of Probability Distributions and Characteristic Functions
- Representations of measurable sets in computable measure theory
- Relative computability and uniform continuity of relations
- Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
- Is the Mandelbrot set computable?
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
- A Note on the Computable Categoricity of $$\ell ^p$$ ℓ p Spaces
- On computable sequences
- Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
- RealLib: An efficient implementation of exact real arithmetic
- Uniform domain representations of ℓp-spaces
- Soundness and Completeness of an Axiom System for Program Verification
- A random polynomial-time algorithm for approximating the volume of convex bodies
- On the computational complexity of the Dirichlet Problem for Poisson's Equation
- The SIAM 100-Digit Challenge
- Singular Coverings and Non-Uniform Notions of Closed Set Computability
- Computable Measure Theory and Algorithmic Randomness
- Admissibly Represented Spaces and Qcb-Spaces
- Real Benefit of Promises and Advice
- Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests
- Numerical Verification Methods and Computer-Assisted Proofs for Partial Differential Equations
- Computer Science Logic
- The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra
- Computing Haar Measures
- Logical Approaches to Computational Barriers
This page was built for publication: Computer Science for Continuous Data
