Average-case polynomial-time computability of hamiltonian dynamics

DOI10.4230/LIPIcs.MFCS.2018.30OpenAlexW2889226253MaRDI QIDQ5005130

Holger Thies, Martin Ziegler, Akitoshi Kawamura

Publication date: 4 August 2021

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9612/pdf/LIPIcs-MFCS-2018-30.pdf/

zbMATH Keywords

dynamical systemsaverage-case complexitycomputable analysisreal computationcomputation in physics

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (9)

Exact real computation of solution operators for linear analytic systems of partial differential equations ⋮ Computability of topological entropy: from general systems to transformations on Cantor sets and the interval ⋮ Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations ⋮ Solovay reducibility and continuity ⋮ A Universal Ordinary Differential Equation ⋮ Parametrised second-order complexity theory with applications to the study of interval computation ⋮ Computational complexity of classical solutions of partial differential equations ⋮ Computability of Differential Equations ⋮ Bit-complexity of solving systems of linear evolutionary partial differential equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lipschitz continuous ordinary differential equations are polynomial-space complete
• Computing power series in polynomial time
• Computational complexity of real functions
• A global existence theorem for the four body problem of Newtonian mechanics
• Average-Case Bit-Complexity Theory of Real Functions
• Complexity Theory for Operators in Analysis
• On the definitions of computable real continuous functions
• On the computational complexity of ordinary differential equations
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• Average Case Complete Problems
• Improbability of Collisions in Newtonian Gravitational Systems. II
• On the complexity of solving initial value problems
• A characterization of real analytic functions

This page was built for publication: Average-case polynomial-time computability of hamiltonian dynamics