Dynamical Systems Theory and Algorithms for NP-hard Problems
DOI10.1007/978-3-030-51264-4_8OpenAlexW3095716452MaRDI QIDQ5131680
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
computational complexitycombinatorial optimizationheuristic algorithmsNP-hardnessdynamical systems theory
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity and performance of numerical algorithms (65Y20) Dynamical systems in numerical analysis (37N30) Theory of computing (68Qxx)
Related Items (1)
Uses Software
Cites Work
- On the numerical approximation of the Perron-Frobenius and Koopman operator
- Hearing the clusters of a graph: A distributed algorithm
- An efficient algorithm for the parallel solution of high-dimensional differential equations
- A data-driven approximation of the koopman operator: extending dynamic mode decomposition
- Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
- Dynamical behavior of epidemiological models with nonlinear incidence rates
- The complexity of optimization problems
- A set of postulates for the foundation of logic
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Continuous relaxations for the traveling salesman problem
- Data-driven spectral analysis of the Koopman operator
- A Decade of Lattice Cryptography
- Applied Koopmanism
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Procrustes Problems
- Deterministic Nonperiodic Flow
- Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
- A variational perspective on accelerated methods in optimization
- Analysis of Fluid Flows via Spectral Properties of the Koopman Operator
- Exploring invariant sets and invariant measures
- Reducibility among Combinatorial Problems
- On the Koopman Operator of Algorithms
- A spectral assignment approach for the graph isomorphism problem
- Turbulence, Coherent Structures, Dynamical Systems and Symmetry
- Computer Solutions of the Traveling Salesman Problem
- Can One Hear the Shape of a Drum?
- Time-Dependent Statistics of the Ising Model
- The complexity of theorem-proving procedures
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Symbolic Dynamics
- A decentralized algorithm for spectral analysis
- ITERATIVE METHODS FOR SCALABLE UNCERTAINTY QUANTIFICATION IN COMPLEX NETWORKS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Dynamical Systems Theory and Algorithms for NP-hard Problems
