Average-case polynomial-time computability of Hamiltonian dynamics
From MaRDI portal
Recommendations
Cites work
- A characterization of real analytic functions
- A global existence theorem for the four body problem of Newtonian mechanics
- Average Case Complete Problems
- Average-case bit-complexity theory of real functions
- Colloques internationaux du Centre National de la Recherche Scientifique. LXX: Le raisonnement en mathématiques et en sciences expérimentales, 24 Septembre à 1 Octobre 1955.
- Complexity theory for operators in analysis
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- Computable analysis. An introduction
- Computational complexity of real functions
- Computing power series in polynomial time
- scientific article; zbMATH DE number 4051615 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 1099342 (Why is no real title available?)
- scientific article; zbMATH DE number 1552437 (Why is no real title available?)
- scientific article; zbMATH DE number 3428577 (Why is no real title available?)
- Improbability of Collisions in Newtonian Gravitational Systems. II
- Lipschitz continuous ordinary differential equations are polynomial-space complete
- On the complexity of solving initial value problems
- On the computational complexity of ordinary differential equations
- On the definitions of computable real continuous functions
Cited in
(11)- Computational complexity of classical solutions of partial differential equations
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- Computability of topological entropy: from general systems to transformations on Cantor sets and the interval
- Parametrised second-order complexity theory with applications to the study of interval computation
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
- Hamiltonian and system-theoretic properties of the HR-algorithm
- Computability of Differential Equations
- A universal ordinary differential equation
- Solovay reducibility and continuity
- What is a \textit{polynomial-time} computable square-integrable function?
- Exact real computation of solution operators for linear analytic systems of partial differential equations
This page was built for publication: Average-case polynomial-time computability of Hamiltonian dynamics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005130)