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

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

2008, Volume 20, Issue 4  

On stability of a vector combinatorial problem with MINMIN criteria
V. A. Emelichev, K. G. Kuz'min 		3–7
On design of circuits of logarithmic depth for inversion in finite fields
S. B. Gashkov, I. S. Sergeev 		8–28
On the realisation of Boolean functions by informational graphs
Yu. S. Shutkin 		29–41
On ranks, Green classes, and the theory of determinants of Boolean matrices
V. B. Poplavskii 		42–60
Finite generability of some groups of recursive permutations
S. A. Volkov 		61–78
Independent systems of generators and the Hopf property for unary algebras
V. K. Kartashov 		79–84
A lower bound for the affinity level for almost all Boolean functions
O. A. Logachev 		85–88
Homomorphisms of shift registers into linear automata
V. I. Solodovnikov 		89–101
Estimates of the number of occurrences of vectors on cycles of linear recurring sequences over a finite field
O. V. Kamlovskii 		102–112
On the asymptotic behaviour of the probability of existence of equivalent tuples with nontrivial structure in a random sequence
V. G. Mikhailov 		113–119
Limit distributions of the number of vectors satisfying a linear relation
V. I. Kruglov 		120–135
Characteristics of random systems of linear equations over a finite field
A. V. Shapovalov 		136–146
Estimates of the complexity of approximation of continuous functions in some classes of determinate functions with delay
A. N. Cherepov 		147–156
Letter to the editors
I. A. Kruglov 		157
Дискретная математика
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025