Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5836308 (Why is no real title available?)
- scientific article; zbMATH DE number 3143695 (Why is no real title available?)
- scientific article; zbMATH DE number 3147888 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 176209 (Why is no real title available?)
- scientific article; zbMATH DE number 3628385 (Why is no real title available?)
- scientific article; zbMATH DE number 1181255 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1746051 (Why is no real title available?)
- scientific article; zbMATH DE number 2152342 (Why is no real title available?)
- scientific article; zbMATH DE number 3994964 (Why is no real title available?)
- scientific article; zbMATH DE number 5180707 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A fundamental effect in computations on real numbers
- A uniformly computable Implicit Function Theorem
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Average-case polynomial-time computability of Hamiltonian dynamics
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- Complexity Blowup in Simulating Analog Linear Time-Invariant Systems on Digital Computers
- Complexity of some geometric and topological problems
- Complexity theory for operators in analysis
- Complexity theory of (functions on) compact metric spaces
- Computability in linear algebra
- Computability of Differential Equations
- Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
- Computational Complexity of Quantum Satisfiability
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Computational complexity of classical solutions of partial differential equations
- Computational complexity of real powering and improved solving linear differential equations
- Computational complexity of the fast adaptive composite grid (FAC) method
- Computational complexity on computable metric spaces
- Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
- Computing over the reals: foundations for scientific computing.
- Concerning Two Series for the Gamma Function
- Displacement ranks of a matrix
- Exact real computation of solution operators for linear analytic systems of partial differential equations
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
- Lipschitz continuous ordinary differential equations are polynomial-space complete
- Maximum norm error estimates of efficient difference schemes for second-order wave equations
- On circulant matrices
- On the computational complexity of integral equations
- On the computational complexity of the Dirichlet problem for Poisson's equation
- Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
- Playing games with algorithms: algorithmic combinatorial game theory
- Realization spaces of arrangements of convex bodies
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines
- Small complexity classes for computable analysis
- Solving analytic differential equations in polynomial time over unbounded domains
- Sparse sets in NP-P: EXPTIME versus NEXPTIME
- Specified precision polynomial root isolation is in NC
- Stability and Convergence of Finite Difference Methods for Systems of Nonlinear Reaction-Diffusion Equations
- The bit-complexity of discrete solutions of partial differential equations: Compact multigrid
- The complexity of satisfiability problems
- The wave equation with computable initial data such that its unique solution is not computable
- Topological complexity with continuous operations
- Weihrauch Complexity in Computable Analysis
Cited in
(5)- Out of Non-linearity: Search Impossible Differentials by the Bitwise Characteristic Matrix
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- Second-order parameterizations for the complexity theory of integrable functions
- Quantitative coding and complexity theory of \textit{continuous} data. I: Motivation, definition, consequences
- A continuous characterization of PSPACE using polynomial ordinary differential equations
This page was built for publication: Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693688)
