The complexity of N-body simulation

DOI10.1007/3-540-56939-1_70zbMath1422.68139OpenAlexW2109735458MaRDI QIDQ4630258

Stephen R. Tate, John H. Reif

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_70

zbMATH Keywords

reachability problempotential field\(n\)-body simulationtarget time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) (n)-body problems (70F10)

Related Items (3)

Can Newtonian systems, bounded in space, time, mass and energy compute all functions? ⋮ The computational complexity of the initial value problem for the three body problem ⋮ Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics

Uses Software

• Fastcap

Cites Work

• Conservative logic
• Relationships between nondeterministic and deterministic tape complexities
• Multipole-accelerated capacitance extraction algorithms for 3-D structures with multiple dielectrics
• Unpredictability and undecidability in dynamical systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of N-body simulation