A theory of complexity for continuous time systems
type: Item
instance of: scholarly article
title: A theory of complexity for continuous time systems
zbMATH Open document ID: 1004.68072
author: Asa Ben-Hur
author: Hava T. Siegelmann
author: Shmuel Fishman
published in: Journal of Complexity
publication date: 2002-06-05T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1750217
zbMATH Keywords: continuous time complexity classes
MaRDI profile type: Publication
full work available at URL: jcom.2001.0581
OpenAlex ID: W2057137378
Wikidata QID: Q58455280
cites work: Q4326408
cites work: Q4692495
cites work: Q4255531
cites work: Q3221403
cites work: Q3135098
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Q5581566
cites work: Unpredictability and undecidability in dynamical systems
cites work: Computability with low-dimensional dynamical systems
cites work: Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
cites work: Q4859383
cites work: Reachability analysis of dynamical systems having piecewise-constant derivatives
cites work: Q4336274
cites work: Mathematical Theory of the Differential Analyzer
cites work: Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
cites work: Iteration, inequalities, and differentiability in analog computers
cites work: Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
cites work: Recursion theory on the reals and continuous-time computation
cites work: ``Neural'' computation of decisions in optimization problems
cites work: Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
cites work: Hamiltonian structure of dynamical systems which solve linear programming problems
cites work: Analog computation via neural networks
cites work: Q4067388
cites work: Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
cites work: Prevalence: a translation-invariant “almost every” on infinite-dimensional spaces
cites work: Real functions, contraction mappings, and P-completeness
cites work: Dynamical Systems which Solve Optimization Problems with Linear Constraints
cites work: Analog computation with dynamical systems
cites work: Finding the maximum, merging, and sorting in a parallel computation model
cites work: Some Remarks on the Foundations of Numerical Analysis
cites work: Q4717938
cites work: Incorporating Condition Measures into the Complexity Theory of Linear Programming
cites work: Q3261425
cites work: Probabilistic analysis of a differential equation for linear programming
cites work: Q4739657
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Q3998396
cites work: Q5691079
cites work: Q4859839
cites work: The maximum flow problem is log space complete for P
cites work: Computational Complexity of Two-Dimensional Regions
cites work: On the computability of fractal dimensions and Hausdorff measure
DOI: 10.1006/JCOM.2001.0581
description: scientific article; zbMATH DE number 1750217