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

Authors

336

  1. LS
    Leonard Susskind

    Stanford University, United States

    4 publications · 1.1K citations

    4

    h-index

  2. CJ
    Claire J. Tomlin

    University of California, Berkeley, United States

    4 publications · 288 citations

    4

    h-index

  3. JH
    Jim Huang

    RTX (United States), United States

    3 publications · 78 citations

    3

    h-index

  4. MC
    Mo Chen

    University of California, Berkeley, United States

    3 publications · 207 citations

    3

    h-index

  5. KY
    Katsu Yamane

    The University of Tokyo, Japan

    3 publications · 80 citations

    3

    h-index

1–5 of 336

Venues

  1. 6

    h-index

  2. The International Journal of Robotics Research

    IJRR · 3 publications · 120 citations

    3

    h-index

  3. arXiv (Cornell University)

    Repository · 3 publications · 58 citations

    3

    h-index

  4. 3

    h-index

  5. 3

    h-index

1–5