Intelligent systems. Theory and applications
RUS
ENG
JOURNALS
PEOPLE
ORGANISATIONS
CONFERENCES
SEMINARS
VIDEO LIBRARY
PACKAGE AMSBIB
JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website
General information
Latest issue
Archive
Search papers
Search references
RSS
Latest issue
Current issues
Archive issues
What is RSS
Intelligent systems. Theory and applications:
Year:
Volume:
Issue:
Page:
Find
Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register
2021, Volume 25, Issue 3
K 85-летнему юбилею Валерия Борисовича Кудрявцева
От редакции
5–6
К 80-летнему юбилею Станислава Владимировича Алешина
От редакции
7
Part 1. General problems of the intellectual systems theory
On a strict consensus ranking algorithm
V. A. Antonyuk
11–34
Sufficient conditions for minimality of star networks in hyperspaces
A. M. Tropin
35–71
Part 2. Special Issues in Intellectual Systems Theory
Testing read-once functions in the elementary basis augmented with all weakly read-multiple unate functions
A. A. Voronenko, D. V. Kaftan
75–82
Type meeting problem for automata in labyrinths
G. D. Kilibarda
83–132
On the formula representation of the characteristic function of the Boolean solution of a linear equation with integer coefficients
M. V. Nosov
133–135
On the expressibility of piecewise constant functions in the space of piecewise parallel
A. D. Otroschenko
137–156
Part 3. Mathematical models
Undescribed exponential growth rates
S. A. Komkov
159–172
On the behavior of the Shannon function of the implementation complexity of monomials system
S. A. Korneev
173–188
On the correspondence between the complexity of the sfe and the number of steps of the Turing machine
M. V. Nosov
189–190
About finitely generated
$A$
maximum-subclasses in the class of linear automata over dyadic rationals
D. V. Ronzhin
191–202
Contact us:
email
Terms of Use
Registration to the website
Logotypes
©
Steklov Mathematical Institute RAS
, 2026