Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Diskretnaya Matematika
Tome 20 (2008)
no. 1
Précédent
Suivant
Volume 20 (2008) no. 1
Sommaire
Random polynomials over a~finite field
G. I. Ivchenko
;
Yu. I. Medvedev
p. 3-24
Random permutations with cycle lengths in a~given finite set
A. N. Timashev
p. 25-37
The Kloss convergence principle for products of random variables with values in a~compact group and distributions determined by a~Markov chain
I. A. Kruglov
p. 38-51
On enumeration of labelled connected graphs by the number of cutpoints
V. A. Voblyi
p. 52-63
On random 2-adjacent 0/1-polyhedra
V. A. Bondarenko
;
A. G. Brodskiy
p. 64-69
The intersection number of complete
$r$
-partite graphs
N. S. Bol'shakova
p. 70-79
Skew Laurent series rings and the maximum condition on right annihilators
A. A. Tuganbaev
p. 80-86
On Mazurov triples of the sporadic group~
$B$
and Hamiltonian cycles of the Cayley graph
A. I. Makosiy
;
A. V. Timofeenko
p. 87-93
Classification of indecomposable Abelian
$(v,5)$
-groups
A. A. Frolov
p. 94-108
On complexity of linear operators on the class of circuits of depth~2
D. Yu. Cherukhin
p. 109-119
On complexity of realisation of a~class of almost symmetric functions by formulas of depth~3
S. E. Cherukhina
p. 120-130
On complexity of the anti-unification problem
E. V. Kostylev
;
V. A. Zakharov
p. 131-144
A block algorithm of Lanczos type for solving sparse systems of linear equations
M. A. Cherepnev
p. 145-150
Some characteristics of dependencies in discrete random sequences
M. I. Tikhomirova
p. 151-158