Dynamical Systems Theory and Algorithms for NP-hard Problems
DOI10.1007/978-3-030-51264-4_8OpenAlexW3095716452MaRDI QIDQ5131680FDOQ5131680
Authors: Tuhin Sahai 
Publication date: 9 November 2020
Published in: Advances in Dynamics, Optimization and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.05052
Recommendations
- NP-complete problems with chaotic dynamics
- Dynamical systems, graphs, and algorithms
- scientific article; zbMATH DE number 510304
- scientific article; zbMATH DE number 5722780
- scientific article; zbMATH DE number 645860
- An NP-hardness result for nonlinear systems
- Approximation Algorithms for Optimization of Combinatorial Dynamical Systems
- Algorithmic complexity of points in dynamical systems
- Computability and dynamical systems
- scientific article; zbMATH DE number 1302186
computational complexitycombinatorial optimizationNP-hardnessheuristic algorithmsdynamical systems theory
Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Abstract computational complexity for mathematical programming problems (90C60) Theory of computing (68Qxx) Dynamical systems in numerical analysis (37N30)
Cites Work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
- Introduction to algorithms.
- Deterministic Nonperiodic Flow
- Analysis of Fluid Flows via Spectral Properties of the Koopman Operator
- Reducibility among combinatorial problems
- Turbulence, coherent structures, dynamical systems and symmetry.
- Procrustes Problems
- The complexity of optimization problems
- Handbook of dynamical systems. Volume 1A
- Title not available (Why is that?)
- A decentralized algorithm for spectral analysis
- Dynamical behavior of epidemiological models with nonlinear incidence rates
- Time-Dependent Statistics of the Ising Model
- The complexity of theorem-proving procedures
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Title not available (Why is that?)
- Can One Hear the Shape of a Drum?
- Applied Koopmanism
- Computer Solutions of the Traveling Salesman Problem
- A data-driven approximation of the koopman operator: extending dynamic mode decomposition
- Hearing the clusters of a graph: A distributed algorithm
- On the numerical approximation of the Perron-Frobenius and Koopman operator
- Title not available (Why is that?)
- Title not available (Why is that?)
- An efficient algorithm for the parallel solution of high-dimensional differential equations
- Symbolic Dynamics
- Exploring invariant sets and invariant measures
- Data-driven spectral analysis of the Koopman operator
- A decade of lattice cryptography
- A variational perspective on accelerated methods in optimization
- Title not available (Why is that?)
- A set of postulates for the foundation of logic
- Continuous relaxations for the traveling salesman problem
- A spectral assignment approach for the graph isomorphism problem
- Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
- ITERATIVE METHODS FOR SCALABLE UNCERTAINTY QUANTIFICATION IN COMPLEX NETWORKS
- On the Koopman operator of algorithms
Cited In (2)
Uses Software
This page was built for publication: Dynamical Systems Theory and Algorithms for NP-hard Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131680)
