Second-order parameterizations for the complexity theory of integrable functions

DOI10.1007/978-3-032-09645-6_2MaRDI QIDQ6851549zbMATH OpenFDO

Authors Aras Bacho, Martin Ziegler

Publication date 27 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-09645-6_2

zbMATH Keywords

approximation theorycomplexity theoryintegrable functionssecond-order parameterization

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites work

• A computable ordinary differential equation which possesses no computable solution
• A new Characterization of Type-2 Feasibility
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
• Complexity for type-2 relations
• Complexity theory for operators in analysis
• Complexity theory for spaces of integrable functions
• Complexity theory of (functions on) compact metric spaces
• Computability of compact operators on computable Banach spaces with bases
• Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
• Computability structure of the Sobolev spaces and its applications
• Computational complexity on computable metric spaces
• Computer Science for Continuous Data
• Computing over the reals: foundations for scientific computing.
• Exact real computation of solution operators for linear analytic systems of partial differential equations
• Functional analysis, Sobolev spaces and partial differential equations
• 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 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1557107 (Why is no real title available?)
• IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
• Lipschitz continuous ordinary differential equations are polynomial-space complete
• Logical Approaches to Computational Barriers
• On the computational complexity of the Dirichlet problem for Poisson's equation
• On the rapid computation of various polylogarithmic constants
• Parametrized complexity theory.
• Quantitative coding and complexity theory of \textit{continuous} data. I: Motivation, definition, consequences
• Semantics, specification logic, and Hoare logic of exact real computation
• The computational complexity of maximization and integration
• The multiplier problem for the ball
• The wave equation with computable initial data such that its unique solution is not computable
• TheL^pconvergence of Fourier series on triangular domains
• Theory of representations
• Type‐2 computability on spaces of integrable functions

This page was built for publication: Second-order parameterizations for the complexity theory of integrable functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851549)