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


1995, Volume 7, Issue 1  


Combinatorial problems of vector optimization
V. A. Emelichev, M. K. Kravtsov
3
On the complexity of the realization of Boolean matrices with a connected boundary
I. R. Khaverlik
19
Undecidability of the completeness and A-completeness problems for some systems of automaton functions
D. N. Babin
52
On the completeness of gradient gate circuits
A. E. Andreev
66
Multiprocessor scheduling and combinatorial configurations
N. N. Kuzyurin
77
On a probabilistic approach to solving systems of equations with integer-valued unknowns
G. V. Balakin
88
An algorithm for discrete logarithms over an arbitrary finite field
I. A. Semaev
99
Upper bounds on the complexity of the realization of characteristic functions of group codes by switching circuits without zero chains
I. O. Sokolov
110
On an approach to obtaining statistical estimates for the size of a general population
S. V. Pazizin
123
On the waiting time in a scheme for the random allocation of colored particles
B. I. Selivanov
134
On the waiting time in an allocation scheme with reflection
G. I. Ivchenko, Yu. I. Medvedev
145
A. A. Markov, 1937–1994.
152
Дискретная математика
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020