|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ИНХС РАН |
||
Discrete Mathematics and Applicationsжурнал
Индексирование:
Scopus (1 января 1970 г.-),
Emerging Sources Citation Index (1 января 2015 г.-),
Журналы РФ в Scopus (1 января 1970 г.-),
Журналы РФ в Scopus (1 января 1970 г.-),
Zentralblatt MATH (zbMATH) (1 января 1970 г.-)
Период активности журнала:
не указан
- Другие названия журнала: Discrete Math Appl, Discrete Math. Appl, Discrete Mathematics and Applicationsпоказать полностью...
- Сайт журнала: https://www.degruyter.com/journal/key/DMA/html
- Издательство: de Gruyter
- Местоположение издательства: Germany
-
Аннотация:
Discrete Mathematics and Applications provides the latest information on the development of discrete mathematics in Russia to a world-wide readership. The journal contains papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics. Discrete Mathematics and Applications covers various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.
The journal is published bimonthly, simultaneously with the Russian edition as a cover-to-cover translation. Issues contain, in addition to original articles and reviews in the above-mentioned subject areas, reviews of books published in and outside Russia and information notes. Articles written in the English-language are most welcome!
Topics
- Combinatorial analysis
- Graph theory
- Functional systems theory
- Cryptology
- Coding
- Probabilistic problems of discrete mathematics
- Algorithms and their complexity
- Combinatorial and computational problems of number theory and of algebra
- Number theory
- Combinatorics and graph
- Probability theory
- Statistics
- ISSN: 0924-9265 (Print), 1569-3929
Статьи, опубликованные в журнале
-
- 2022 Finding periods of Zhegalkin polynomials
- Selezneva S.N.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 32, № 3, с. 129-138 DOI
-
- 2022 Single diagnostic tests for inversion faults of gates in circuits over arbitrary bases
- Liubich I.G., Romanov D.S.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 32, № 1, с. 1-9 DOI
-
- 2021 Conditions of A-completeness for linear automata over dyadic rationals
- Ронжин Д.В.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 31, № 3, с. 179-192 DOI
-
- 2021 Implementation complexity of Boolean functions with a small number of ones
- Redkin N.P.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 31, № 4, с. 271-279
-
- 2021 Learning of monotone functions with single error correction
- Selezneva S.N., Liu Y.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 31, № 3, с. 193-205 DOI
-
- 2021 Multiaffine polynomials over a finite field
- Selezneva S.N.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 31, № 6, с. 421-430 DOI
-
- 2021 On closed classes in partial k-valued logic that contain all polynomials
- Alekseev Valeriy B.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 31, № 4, с. 231-240 DOI
-
- 2021 On the complexity of implementation of a system of two monomials by composition circuits
- Korneev S.A.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 31, № 2, с. 113-125
-
- 2021 Reduction of the integer factorization complexity upper bound to the complexity of the Diffie–Hellman problem
- Cherepnev M.A.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 31, № 1, с. 1-4 DOI
-
- 2020 Asymptotically best method for synthesis of Boolean recursive circuits
- Zhukov Vladimir V., Lozhkin Sergey A.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 30, № 2, с. 137-146 DOI
-
- 2020 Attribute-efficient learning of Boolean functions from Post closed classes
- Быстрыгова А.В.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 30, № 5, с. 285-301 DOI
-
- 2020 Completeness criterion for the enumeration closure operator in three-valued logic
- Marchenkov S.S.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 30, № 1, с. 1-6
-
- 2020 Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method
- Kolpakov Roman M., Posypkin Mikhail A.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 30, № 5, с. 313-325 DOI
-
- 2020 Maximum subclasses in classes of linear automata over finite fields
- Часовских А.А.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 30, № 6, с. 365-374 DOI
-
- 2020 On classes of functions of many-valued logic with minimal logarithmic growth rate
- Stepan Komkov
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 30, № 4, с. 265-272
-
- 2020 On stabilization of an automaton model of migration processes
- Vasiliev D.I., Gasanov E.E., Kudryavtsev V.B.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 30, № 2, с. 117-128
-
- 2020 On the Δ-equivalence of Boolean functions
- Logachev O.A., Fedorov S.N., Yashchenko V.V.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 30, № 2, с. 93-101 DOI
-
- 2020 On weak positive predicates over a finite set
- Selezneva S.N.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 30, № 3, с. 203-213 DOI
-
- 2020 The complexity of checking the polynomial completeness of finite quasigroups
- Galatenko Aleksey V., Pankratiev Anton E.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 30, № 3, с. 169-175 DOI
-
- 2020 The generalized complexity of linear Boolean functions
- Redkin Nikolay P.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 30, № 1, с. 39-44
-
- 2020 Universal functions for linear functions depending on two variables
- Вороненко А.А., Окунева А.С.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 30, № 5, с. 353-356
-
- 2019 A criterion of perfect balance for shift-composition of functions over a finite alphabet
- Logachev Oleg A.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 29, № 1, с. 1-5 DOI
-
- 2019 A method of synthesis of irredundant circuits admitting single fault detection tests of constant length
- Romanov D.S., Romanova E.Yu
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 29, № 1, с. 35-48 DOI
-
- 2019 Boolean functions as points on the hypersphere in the Euclidean space
- Logachev Oleg A., Fedorov Sergey N., Yashchenko Valerii V.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 29, № 2, с. 89-101 DOI
-
- 2019 Cardinality of generating sets for operations from the Post lattice classes
- Komkov Stepan A.
- в журнале Discrete Mathematics and Applications, издательство de Gruyter (Germany), том 29, № 3, с. 159-173 DOI