The complexity of N-body simulation
From MaRDI portal
Publication:4630258
Recommendations
- Computational Structure of the N-Body Problem
- scientific article; zbMATH DE number 1057776
- N-body simulations
- scientific article; zbMATH DE number 4057090
- \(N\)-body simulations of massively parallel architectures
- Direct \(N\)-body simulations
- scientific article; zbMATH DE number 663846
- Publication:4860177
- The computational complexity of the initial value problem for the three body problem
- The Event-Driven Approach toN-Body Simulation
Cites work
- scientific article; zbMATH DE number 4080996 (Why is no real title available?)
- scientific article; zbMATH DE number 41859 (Why is no real title available?)
- scientific article; zbMATH DE number 42384 (Why is no real title available?)
- Conservative logic
- Multipole-accelerated capacitance extraction algorithms for 3-D structures with multiple dielectrics
- Relationships between nondeterministic and deterministic tape complexities
- Unpredictability and undecidability in dynamical systems
Cited in
(7)- Three-dimensional simulation in \(N\)-body problem
- scientific article; zbMATH DE number 663846 (Why is no real title available?)
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
- Average-case polynomial-time computability of Hamiltonian dynamics
- Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
- scientific article; zbMATH DE number 1500640 (Why is no real title available?)
- The computational complexity of the initial value problem for the three body problem
This page was built for publication: The complexity of N-body simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630258)