Scaling and universality of the complexity of analog computation

DOI10.1063/1.2194471zbMath1146.37306arXivcond-mat/0511354OpenAlexW2145316744WikidataQ51629966 ScholiaQ51629966MaRDI QIDQ3531580

Shmuel Fishman, Joshua Feinberg, Yaniv S. Avizrats

Publication date: 3 November 2008

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0511354

Mathematics Subject Classification ID

Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic analysis of a differential equation for linear programming
• Hamiltonian structure of dynamical systems which solve linear programming problems
• Analog computation with dynamical systems
• A theory of complexity for continuous time systems
• Fast and efficient parallel solution of dense linear systems
• Random matrix theory for the analysis of the performance of an analog computer: a scaling theory
• Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
• Large rectangular random matrices
• The Efficiency of the Simplex Method: A Survey
• Dynamical Systems which Solve Optimization Problems with Linear Constraints
• Probabilistic Models for Linear Programming
• Characterization of Chaotic Quantum Spectra and Universality of Level Fluctuation Laws

This page was built for publication: Scaling and universality of the complexity of analog computation