Diskretnaya Matematika
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 linear functions depending on two variables
A. A. Voronenko, A. S. Okuneva 		3–7
On the dependence of the complexity and depth of reversible circuits consisting of NOT, CNOT, and 2-CNOT gates on the number of additional inputs
D. V. Zakablukov 		8–26
Perfect matchings and $K_{1, p}$-restricted graphs
P. A. Irzhavski, Yu. L. Orlovich 		27–50
Boolean analogues of Pascal triangle with the maximum possible number of ones
F. M. Malyshev 		51–59
On the action of the implicative closure operator on the set of partial functions of the multivalued logic
S. S. Marchenkov 		60–73
On distance-regular graphs with $c_2=2$
A. A. Makhnev, M. S. Nirova 		74–80
On the complexity of monotone circuits for threshold symmetric Boolean functions
I. S. Sergeev 		81–109
Reduction of the integer factorization complexity upper bound to the complexity of the Diffie–Hellman problem
M. A. Cherepnev 		110–114
Classification of Hadamard productsof one-codimensional subcodesof Reed–Muller codes
I. V. Chizhov, M. A. Borodin 		115–134
Large deviations of branching process in a random environment. II
A. V. Shklyaev 		135–156
Дискретная математика
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026