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

1993, Volume 5, Issue 4  

A method for the design of combinational circuits suitable for control
V. N. Noskov 		3–23
On the intersection of some classes of convergences
A. N. Degtev 		24–28
Large deviation theorems in a scheme of allocating identical particles to different cells
A. N. Timashev 		29–42
Indistinguishability of finite automata in a stationary observation environment
I. S. Grunskii, O. M. Kopytova 		43–53
Inclusion and ambiguity problems for regular events in semigroups
L. P. Lisovik 		54–74
On the correspondence between interval graphs and Boolean functions
Nguyen Kim Anh 		75–86
Families of closed classes of $k$-valued logic that are preserved by all automorphisms
Nguyen Van Hoa 		87–108
Reconstructibility of the fundamental invariants of a graph
E. V. Bratceva 		109–119
Efficient algorithms for calculating the modality of polygons
S. N. Bespamyatnykh 		120–132
On the number of strictly balanced subgraphs of random homogeneous hypergraphs
A. V. Shapovalov 		133–144
Strongly regular locally latticed graphs
N. D. Zyulyarkina, A. A. Makhnev 		145–150
On Losev's method for fast vector-matrix multiplication
F. F. Zheludevich 		151–157
Дискретная математика
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026