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

1990, Volume 2, Issue 1  

The method of Newton sums in problems of combinatorial optimization
A. I. Barvinok 		3–15
The edge independence number and the covering number for regular graphs
V. E. Tarakanov 		16–25
Conditions for regularity of finite autonomous automata
È. A. Primenko, È. F. Skvortsov 		26–30
Superpositions of automata and linear spaces connected with them
V. I. Malygin 		31–42
An asymptotic formula for the number of self-inverse labeled oriented graphs
A. S. Ambrosimov 		43–49
Extremal ideals of the lattice of multisets for symmetric functionals
S. L. Bezrukov, V. P. Voronin 		50–58
Optimal trajectories of a dynamic programming scheme and extremal degrees of nonnegative matrices
V. D. Matveenko 		59–71
Universal labyrinth traps for finite sets of automata
G. Kilibarda 		72–79
Self-correction for buffer switching circuits
I. A. Vikhlyantsev 		80–86
Representation of dictionary predicates from the arithmetical hierarchy
S. S. Marchenkov 		87–93
Solution of systems of automaton equations
A. S. Podkolzin, Š. M. Ušćumlić 		94–103
Almost optimal trees for computing logic functions
M. I. Luganskaya 		104–112
Embeddedness of partitions, distributions and weighings
B. S. Stechkin 		113–129
An optimal search for extrema of convex functions on lattices
M. M. Kovalev, A. V. Moshchenskii 		130–141
Lower bounds on computation time
Yu. I. Yanov 		142–154
Upper bounds for the capacity of discrete communication channels
N. N. Sharov 		155–157
Дискретная математика
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026