Open AccessTime complexity of algorithms of full analysis of dynamical systems with discrete time, defined on a finite set of states
Author(s) -
V.I. Ruban,
A. A. Rudenko
Publication year - 2016
Publication title -
researches in mathematics
Language(s) - English
Resource type - Journals
eISSN - 2664-5009
pISSN - 2664-4991
DOI - 10.15421/241615
Subject(s) - discrete time and continuous time , algorithm , dynamical systems theory , set (abstract data type) , mathematics , finite set , time complexity , computer science , order (exchange) , theoretical computer science , discrete mathematics , mathematical analysis , physics , statistics , quantum mechanics , programming language , finance , economics
For discrete dynamical systems with a finite number of states, we obtain order of time complexity ascension of algorithms of their full analysis.