The complexity of N-body simulation
From MaRDI portal
Publication:4630258
DOI10.1007/3-540-56939-1_70zbMath1422.68139MaRDI QIDQ4630258
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
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
70F10: (n)-body problems
Related Items
Can Newtonian systems, bounded in space, time, mass and energy compute all functions?, Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
Uses Software