Geodesic

Volume 2 (1990) no. 3

Sommaire

An algorithm for solving an $m$-dimensional knapsack problem with random coefficients
p. 3-9
Construction of a~truncated tree of variants for a~general problem of scheduling theory
p. 10-20
Transformations of Latin squares
p. 21-28
Uniform id-decomposition of Boolean functions
p. 29-41
Completeness with given accuracy in function systems of program type
p. 42-49
Complexity of self-correcting algorithms for two search problems
p. 50-55
Dichotomous graphs with maximal girth
p. 56-64
Sums of subpermanents of linear hulls of permutation matrices
p. 65-80
The feedback operation and a~class of group automata
p. 81-89
Complexity of some problems on hereditary classes of graphs
p. 90-96
A~zero-one law for many-sorted first-order predicate logic
p. 97-101
Construction of minimal realizations of hypergraphs
p. 102-114
An estimate for the incomplete sum of multiplicative characters of polynomials
p. 115-119
Determinability of finitely generated abelian groups by the lattice of subgroups invariant under an involutive automorphism
p. 120-127
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$
p. 128-136
On the number of cycles in a~random nonequiprobable graph
p. 109-128
Regular languages with polynomial growth in the number of words
p. 285-292
Comparisons modulo a~prime for the number of $(0,1)$-matrices
p. 153-157
Seminar for algebra and mathematical logic dedicated to the memory of V.~D.~Belousov
V.~B.~Kudryavtsev, A.~S.~Podkolzin, A.~A.~Bolotov