RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


2020, Volume 32, Issue 1  


Universal functions for low arity linear functions
A. A. Voronenko, A. S. Okuneva
3
General Upper Bounds for Gate Complexity and Depth of Reversible Circuits Consisting of NOT, CNOT and 2-CNOT Gates
D. V. Zakablukov
8
Perfect matchings and $K_{1, p}$-restricted graphs
P. A. Irzhavski, Yu. L. Orlovich
27
Boolean analogues of Pascal triangle with the maximum possible number of ones
F. M. Malyshev
51
On the action of implicative closure operator on the set of partial functions in many-valued logic
S. S. Marchenkov
60
On a distance-regular graphs with $c_2=2$
A. A. Makhnev, M. S. Nirova
74
On the complexity of monotone circuits for threshold symmetric Boolean functions
I. S. Sergeev
81
Upper bound on the complexity of the discrete logarithm problem, including the complexity of the Diffie-Hellman problem
M. A. Cherepnev
110
Hadamard products classification of subcodes of Reed–Muller codes codimension 1
I. V. Chizhov, M. A. Borodin
115
Large Deviations for Branching Processes in Random Environment. II
A. V. Shklyaev
135
Дискретная математика
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020