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

2021, Volume 33, Issue 4  

Some classes of easily testable circuits in the Zhegalkin basis
Yu. V. Borodina 		3–10
Multi-dimensional Kronecker sequences with a small number of gap lengths
Ch. Weiss 		11–18
Asymptotic local probabilities of large deviations for branching process in random environment with geometric distribution of descendants
K. Yu. Denisov 		19–31
On the concentration of the independence numbers of random hypergraphs
I. O. Denisov, D. A. Shabanov 		32–46
On implementation of some systems of elementary conjunctions in the class of separating contact circuits
E. G. Krasulina 		47–60
On distance-regular graphs $\Gamma$ of diameter 3 for which $\Gamma_3$ is a triangle-free graph
A. A. Makhnev, Venbin Guo 		61–67
Decomposition of polynomials using the shift-composition operation
V. I. Nozdrunov 		68–82
Local limit theorem for the number of empty cells in a scheme of random equiprobable allocations
O. P. Orlov 		83–93
On implementation of Boolean functions by contact circuits of minimal uniform width
K. A. Popkov 		94–109
Nonlinearity of functions over finite fields
V. G. Ryabov 		110–131
Limit theorem for a smoothed version of the spectral test for testing the equiprobability of a binary sequence
M. P. Savelov 		132–140
On properties of multiaffine predicates on a finite set
S. N. Selezneva 		141–152
On the linear disjunctive decomposition of a $p$-logic function into a product of functions
A. V. Cheremushkin 		153–171
Дискретная математика
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026