Dynamical Systems Theory and Algorithms for NP-hard Problems

by   Tuhin Sahai, et al.

This article surveys the burgeoning area at the intersection of dynamical systems theory and algorithms for NP-hard problems. Traditionally, computational complexity and the analysis of non-deterministic polynomial-time (NP)-hard problems have fallen under the purview of computer science and discrete optimization. However, over the past few years, dynamical systems theory has increasingly been used to construct new algorithms and shed light on the hardness of problem instances. We survey a range of examples that illustrate the use of dynamical systems theory in the context of computational complexity analysis and novel algorithm construction. In particular, we summarize a) a novel approach for clustering graphs using the wave equation partial differential equation, b) invariant manifold computations for the traveling salesman problem, c) novel approaches for building quantum networks of Duffing oscillators to solve the MAX-CUT problem, d) applications of the Koopman operator for analyzing optimization algorithms, and e) the use of dynamical systems theory to analyze computational complexity.


What's Decidable about Discrete Linear Dynamical Systems?

We survey the state of the art on the algorithmic analysis of discrete l...

A New Model in Firefighting Theory

Continuous and discrete models for firefighting problems are well-studie...

On the Complexity of Minimum-Cost Networked Estimation of Self-Damped Dynamical Systems

In this paper, we consider the optimal design of networked estimators to...

Optimizing Neural Networks via Koopman Operator Theory

Koopman operator theory, a powerful framework for discovering the underl...

Dynamical systems in wireless communications: The road less traveled by

Dynamical systems are by no means strangers in wireless communications, ...

Complexity continuum within Ising formulation of NP problems

A promising approach to achieve computational supremacy over the classic...

Sparse Polynomial Optimization: Theory and Practice

The problem of minimizing a polynomial over a set of polynomial inequali...

Please sign up or login with your details

Forgot password? Click here to reset