Computational Complexity In Dynamics
Computational Complexity in Dynamics is a theoretical construct in multibody dynamics that quantifies the asymptotic resource requirements, particularly time and operations, of algorithms used to compute equations of motion within the Newton-Euler formulation, distinguishing it from alternative complexity analyses by its focus on recursive algorithmic efficiency in articulated rigid body systems.
138
Publications
7.3K
Citations
336
Authors
193
Institutions
Publications per year
2017–2026
44
Parents
138
TRUST: A Deterministic Algorithm for Global Optimization
J. Barhen, V. Protopopescu, David B. Reister · Science · 1997 · 185 citations
1–5 of 138
336
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 336
193
Stanford University
Stanford, United States
9 h-index
18 publications
2.9K citations
University of Michigan
Ann Arbor, United States
5 h-index
17 publications
1K citations
University of New Orleans
New Orleans, United States
3 h-index
5 publications
298 citations
University of California, Berkeley
Berkeley, United States
3 h-index
12 publications
1.1K citations
RTX (United States)
Arlington, United States
3 h-index
6 publications
156 citations
The University of Tokyo
Tokyo, Japan
3 h-index
5 publications
128 citations
California Institute of Technology
Pasadena, United States
3 h-index
5 publications
96 citations
Stony Brook University
Stony Brook, United States
2 h-index
3 publications
189 citations
1–8 of 193
6 publications · 172 citations
6
h-index
IJRR · 3 publications · 120 citations
3
h-index
Repository · 3 publications · 58 citations
3
h-index
3 publications · 76 citations
3
h-index
3 publications · 56 citations
3
h-index
1–5