On the Computational Complexity of Limit Cycles in Dynamical Systems

DOI10.1145/2840728.2840752zbMath1334.68103arXiv1511.07605OpenAlexW2962875471MaRDI QIDQ2800588

Nisheeth K. Vishnoi, Christos H. Papadimitriou

Publication date: 15 April 2016

Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.07605

zbMATH Keywords

computational complexitylimit cyclesdynamical systemsPoincaré-Bendixson theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamics induced by flows and semiflows (37C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: On the Computational Complexity of Limit Cycles in Dynamical Systems