Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Diskretnaya Matematika
Tome 7 (1995)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Combinatorial problems of vector optimization
V. A. Emelichev
;
M. K. Kravtsov
p. 3-18
On the complexity of the realization of Boolean matrices with a connected boundary
I. R. Khaverlik
p. 19-51
Undecidability of the completeness and {\it A}-completeness problems for some systems of automaton functions
D. N. Babin
p. 52-65
On the completeness of gradient gate circuits
A. E. Andreev
p. 66-76
Multiprocessor scheduling and combinatorial configurations
N. N. Kuzyurin
p. 77-87
On a probabilistic approach to solving systems of equations with integer-valued unknowns
G. V. Balakin
p. 88-98
An algorithm for discrete logarithms over an arbitrary finite field
I. A. Semaev
p. 99-109
Upper bounds on the complexity of the realization of characteristic functions of group codes by switching circuits without zero chains
I. O. Sokolov
p. 110-122
On an approach to obtaining statistical estimates for the size of a general population
S. V. Pazizin
p. 123-133
On the waiting time in a scheme for the random allocation of colored particles
B. I. Selivanov
p. 134-144
On the waiting time in an allocation scheme with reflection
G. I. Ivchenko
;
Yu. I. Medvedev
p. 145-151
A.\,A. Markov, 1937--1994.
p. 152-157
Sommaire du
Fascicule no. 2
On the number of bases in a transportation problem with exclusions
M. K. Kravtsov
;
A. A. Gladkii
p. 3-18
Local inversion of a finite automaton by means of automata
O. A. Logachev
;
G. V. Proskurin
;
V. V. Yashchenko
p. 19-33
Representations of linear recurrent sequences of maximum period over a finite field
V. L. Kurakin
p. 34-39
On a one-dimensional problem of interval search
È. È. Gasanov
p. 40-60
On modeling the growth of convex and tree-like configurations in homogeneous structures
A. Dumov
p. 61-78
A lower bound for the cardinality of a class of cyclic difference families
B. T. Rumov
p. 79-87
The cutwidth and value of the vertex separation of hypergraphs and their K\"onig representations
P. A. Golovach
p. 88-94
On the complexity of the realization of a universal function by circuits consisting of functional elements
V. V. Korovin
p. 95-102
Decomposable statistics in inverse urn problems
G. I. Ivchenko
;
A. V. Ivanov
p. 103-117
On the consistency of the maximum likelihood method in the problem of ordering the outcomes of a multinomial scheme in correspondence with their probabilities
A. S. Ambrosimov
p. 118-130
On a scheme for Markov allocations by groups of cells
M. I. Tikhomirova
;
V. P. Chistyakov
p. 131-139
Poisson limit distribution of the number of empty cells in a generalized equiprobable scheme for the distribution of particles by groups
A. N. Timashev
p. 140-145
Probability of the consistency of random systems of Boolean equations
A. V. Shapovalov
p. 146-159
Sommaire du
Fascicule no. 3
The weight of an
$n$
-dimensional Boolean vector and addition modulo
$2^n$
; generalization to the case of modulo
$m^n$
B. A. Sevast'yanov
p. 3-7
Some estimates for the distribution of the height of a tree for digital searching
V. A. Vatutin
;
V. G. Mikhailov
p. 8-18
Limit distributions for the maximum size of a tree in a random forest
Yu. L. Pavlov
p. 19-32
Upper bounds for cumulants of the sum of multi-indexed random variables
A. B. Gorchakov
p. 33-47
A method for constructing polynomials for functions of
$k$
-valued logic
D. G. Meshchaninov
p. 48-60
Realization of Boolean functions by nonrepetitive formulas
N. A. Peryazev
p. 61-68
Sequential and simultaneous aggregation of Diophantine equations
D. A. Babaev
;
S. S. Mardanov
p. 69-80
Coverings of a sphere, and extremal properties of orthogonal polynomials
V. A. Yudin
p. 81-88
On a method for constructing well-distributed sequences
E. M. Matveev
p. 89-99
On the character of the depth of a lattice of closed classes of nonhomogeneous functions
L. A. Arutyunyan
p. 100-120
On a strongly regular graph with the parameters
$(64,18,2,6)$
A. A. Makhnev
p. 121-128
О приближении случайной булевой функции множеством квадратичных форм
B. V. Ryazanov
;
S. I. Chechëta
p. 129-145
On the number of ordered pairs of
$l$
-balanced sets of length
$n$
Yu. V. Tarannikov
p. 146-156
Review of a book, Yu.\,V.~Borovskikh, V.\,S.~Korolyuk ``Random Permanents''
V. G. Mikhailov
p. 157-160
Sommaire du
Fascicule no. 4
On the automata functional systems
V. B. Kudryavtsev
p. 3-28
The threshold effect for systems of random equations of a special type
V. F. Kolchin
;
V. I. Khokhlov
p. 29-39
On a model of plane switching circuits
O. A. Zadorozhnyuk
;
A. N. Rybko
p. 40-50
On checking tests for a parity counter
V. G. Khakhulin
p. 51-59
On equations with subgroup constraints on solutions in free groups
V. G. Durnev
p. 60-67
Algorithms for computing determinants in commutative rings
G. I. Malashonok
p. 68-76
New inequality relations between depth and delay
V. M. Khrapchenko
p. 77-85
The number of components in a random bipartite graph
A. I. Saltykov
p. 86-94
Ravines of functions and nonuniformity of their supergraphs
E. G. Belousov
;
E. G. Andronov
p. 95-115
Associators, commutators and the linearity of a quasigroup
G. B. Belyavskaya
p. 116-125
Chromatic uniqueness of graphs that are homeomorphic to
$K_4$
V. L. Mironov
p. 126-135
Orthogonal starters and multidimensional Kirkman hypercubes
A. V. Nazarok
p. 136-139
Spectra of nonoriented de Bruijn graphs and an upper bound on the independence number for such graphs
S. Yu. Mel'nikov
p. 140-144
Similarity of involutive matrices over a local ring of characteristic
$2^k$
T. G. Gazaryan
p. 145-156