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

1992, Volume 4, Issue 3  

The behavior of automata in labyrinths
V. B. Kudryavtsev, Š. M. Ušćumlić, G. Kilibarda 		3–28
Scheme complexity of discrete optimization
A. A. Markov 		29–46
$T$-partitions of quasigroups and groups
M. M. Glukhov 		47–56
On an encoding system constructed on the basis of generalized Reed–Solomon codes
V. M. Sidel'nikov, S. O. Shestakov 		57–63
Random minimal coverings of sets
V. N. Sachkov 		64–74
On the compatibility of a system of random comparisons
V. F. Kolchin 		75–85
On the length of test automaton-realizable experiments with automaton labyrinths
G. Yu. Kudryavtsev 		86–100
An asymptotic formula for the number of asymmetric graphs
A. S. Ambrosimov 		101–107
Transportation polytopes with a minimal number of $k$-faces
M. K. Kravtsov 		108–117
A lower bound on the complexity of information networks for a class of information search problems
È. È. Gasanov 		118–127
Some classes of permutations with cycle lengths in a given set
A. L. Yakymiv 		128–134
On Slupecki classes in the systems $P_k\times\dots\times P_l$
S. S. Marchenkov 		135–148
Russo's formula for Poisson point fields and its applications
S. A. Zuev 		149–160
Дискретная математика
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026