RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika // Archive

1990, Volume 2, Issue 3


An algorithm for solving an $m$-dimensional knapsack problem with random coefficients
I. L. Averbakh
3
Construction of a truncated tree of variants for a general problem of scheduling theory
N. N. Vakhania
10
Transformations of Latin squares
A. S. Asratyan, A. N. Mirumyan
21
Uniform id-decomposition of Boolean functions
S. S. Marchenkov
29
Completeness with given accuracy in function systems of program type
Yu. V. Golunkov
42
Complexity of self-correcting algorithms for two search problems
V. V. Morozenko
50
Dichotomous graphs with maximal girth
A. V. Knyazev
56
Sums of subpermanents of linear hulls of permutation matrices
V. S. Shevelev
65
The feedback operation and a class of group automata
V. I. Malygin
81
Complexity of some problems on hereditary classes of graphs
D. V. Korobitsyn
90
A zero-one law for many-sorted first-order predicate logic
V. V. Knyazev
97
Construction of minimal realizations of hypergraphs
A. G. Levin
102
An estimate for the incomplete sum of multiplicative characters of polynomials
S. A. Stepanov, I. E. Shparlinski
115
Determinability of finitely generated abelian groups by the lattice of subgroups invariant under an involutive automorphism
N. P. Belyakova
120
Questions of completeness for finitely generated function systems $\langle P_{k,E_2}\widetilde\Omega\rangle$ and $\langle P_{k,E_2},\widehat\Omega\rangle$
Zh. Dou
128
On the number of cycles in a random nonequiprobable graph
V. F. Kolchin, V. I. Khokhlov
137
Regular languages with polynomial growth in the number of words
A. S. Strogalov
145
Comparisons modulo a prime for the number of $(0,1)$-matrices
E. E. Marenich
153

Information
Seminar for algebra and mathematical logic dedicated to the memory of V. D. Belousov
158
V. B. Kudryavtsev, A. S. Podkolzin, A. A. Bolotov “Elements of the theory of homogeneous structures”
159


© Steklov Math. Inst. of RAS, 2025