Dynamical Systems Theory and Algorithms for NP-hard Problems
From MaRDI portal
Publication:5131680
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)
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
Cites work
- scientific article; zbMATH DE number 6678650 (Why is no real title available?)
- scientific article; zbMATH DE number 3688740 (Why is no real title available?)
- scientific article; zbMATH DE number 1333614 (Why is no real title available?)
- scientific article; zbMATH DE number 1787316 (Why is no real title available?)
- scientific article; zbMATH DE number 841117 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A data-driven approximation of the koopman operator: extending dynamic mode decomposition
- A decade of lattice cryptography
- A decentralized algorithm for spectral analysis
- A set of postulates for the foundation of logic
- A spectral assignment approach for the graph isomorphism problem
- A variational perspective on accelerated methods in optimization
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An efficient algorithm for the parallel solution of high-dimensional differential equations
- Analysis of Fluid Flows via Spectral Properties of the Koopman Operator
- Applied Koopmanism
- Can One Hear the Shape of a Drum?
- Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
- Computer Solutions of the Traveling Salesman Problem
- Continuous relaxations for the traveling salesman problem
- Data-driven spectral analysis of the Koopman operator
- Deterministic Nonperiodic Flow
- Dynamical behavior of epidemiological models with nonlinear incidence rates
- Exploring invariant sets and invariant measures
- Handbook of dynamical systems. Volume 1A
- Hearing the clusters of a graph: A distributed algorithm
- ITERATIVE METHODS FOR SCALABLE UNCERTAINTY QUANTIFICATION IN COMPLEX NETWORKS
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Introduction to algorithms.
- Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On the Koopman operator of algorithms
- On the numerical approximation of the Perron-Frobenius and Koopman operator
- Procrustes Problems
- Reducibility among combinatorial problems
- Symbolic Dynamics
- The complexity of optimization problems
- The complexity of theorem-proving procedures
- Time-Dependent Statistics of the Ising Model
- Turbulence, coherent structures, dynamical systems and symmetry.
Cited in
(2)
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)
