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


1997, Volume 9, Issue 2  


Code and design
V. A. Yudin
3
Closed classes in many-valued logic that contain the class of polynomials
G. P. Gavrilov
12
The structure of the lattice of closed classes of polynomials
A. A. Krokhin, K. L. Safin, E. V. Sukhanov
24
A lower bound for the complexity of the realization of a Boolean function by two-layer switching circuits on a plane integral lattice
O. A. Zadorozhnyuk
40
On the complexity and depth of circuits realizing partial Boolean functions
A. V. Chashkin
53
On the functional decomposability of Boolean threshold functions
A. N. Shurupov
59
On the completeness of systems of finite automata
V. A. Orlov
74
On some properties of algebras with simple multiplication that contain associative subalgebra
M. Plukas
79
Realization of hypergraphs by trees of minimal diameter
O. I. Mel'nikov
91
An analogue of the Whitney theorem for edge graphs of multigraphs, and edge multigraphs
I. É. Zverovich
98
On minimal universal graphs for hereditary classes
V. V. Lozin
106
On regressive enumerations
V. L. Mikheev
116
Limit theorems for the number of empty cells
E. R. Khakimullin, N. Yu. Enatskaya
120
A conditional limit theorem with a random number of summands
S. G. Gushchin
131
$\Sigma TC$-generated languages and relative equivalence problems
L. P. Lisovik
139
Дискретная математика
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019