|
Author Index, 1990, Volume 2
Sh. M. Agadzhanyan, G. I. Ivchenko
Some conditional distributions for random graphs
Diskr. Mat., 1990, Volume 2:2, 89–96
|
V. B. Alekseev, V. P. Korzhik
Embeddings of graphs in a surface and the theory of flow graphs
Diskr. Mat., 1990, Volume 2:4, 97–115
|
A. S. Ambrosimov
An asymptotic formula for the number of self-inverse labeled oriented graphs
Diskr. Mat., 1990, Volume 2:1, 43–49
|
A. S. Asratyan, A. N. Mirumyan
Transformations of Latin squares
Diskr. Mat., 1990, Volume 2:3, 21–28
|
I. L. Averbakh
An algorithm for solving an $m$-dimensional knapsack problem with random coefficients
Diskr. Mat., 1990, Volume 2:3, 3–9
|
A. I. Barvinok
The method of Newton sums in problems of combinatorial optimization
Diskr. Mat., 1990, Volume 2:1, 3–15
|
N. P. Belyakova
Determinability of finitely generated abelian groups by the lattice of subgroups invariant under an involutive automorphism
Diskr. Mat., 1990, Volume 2:3, 120–127
|
S. L. Bezrukov, V. P. Voronin
Extremal ideals of the lattice of multisets for symmetric functionals
Diskr. Mat., 1990, Volume 2:1, 50–58
|
V. P. Borovikov
Estimates for functionals of a density constructed from discretized observations
Diskr. Mat., 1990, Volume 2:4, 92–96
|
S. P. Cherkashin
On the structure of random oriented graphs with distinguished edges
Diskr. Mat., 1990, Volume 2:4, 82–91
|
Zh. Dou
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$
Diskr. Mat., 1990, Volume 2:3, 128–136
|
Zh. Dou
Problems of completeness for finitely generated functional systems $\langle P_{k,2},\widetilde\Omega\rangle$ and $\langle P_{k,2},\widehat\Omega\rangle$
Diskr. Mat., 1990, Volume 2:4, 116–124
|
V. A. Emelichev, M. M. Kovalev, A. B. Ramazanov
The error of gradient extrema of the strongly convex function of a discrete argument
Diskr. Mat., 1990, Volume 2:2, 127–137
|
S. B. Gashkov
The complexity of the approximate calculation of real numbers by means of schemes and formulas in various rational bases
Diskr. Mat., 1990, Volume 2:4, 26–46
|
Yu. V. Golunkov
Completeness modulo an ideal in functional systems of program type
Diskr. Mat., 1990, Volume 2:2, 112–120
|
Yu. V. Golunkov
Completeness with given accuracy in function systems of program type
Diskr. Mat., 1990, Volume 2:3, 42–49
|
J. Hromkovič, B. Shuster
The relative complexities of two types of two-dimensional circuits made of functional elements
Diskr. Mat., 1990, Volume 2:2, 121–126
|
G. I. Ivchenko, see Sh. M. Agadzhanyan
Diskr. Mat., 1990, Volume 2:2, 89–96
|
V. I. Khokhlov, see V. F. Kolchin
Diskr. Mat., 1990, Volume 2:3, 137–145
|
G. Kilibarda
Universal labyrinth traps for finite sets of automata
Diskr. Mat., 1990, Volume 2:1, 72–79
|
G. Kilibarda
Traversing finite labyrinths by systems of automata
Diskr. Mat., 1990, Volume 2:2, 71–81
|
A. V. Knyazev
Dichotomous graphs with maximal girth
Diskr. Mat., 1990, Volume 2:3, 56–64
|
A. V. Knyazev
Upper bounds on exponents of pseudosymmetric graphs
Diskr. Mat., 1990, Volume 2:4, 63–71
|
V. V. Knyazev
A zero-one law for many-sorted first-order predicate logic
Diskr. Mat., 1990, Volume 2:3, 97–101
|
V. F. Kolchin, V. I. Khokhlov
On the number of cycles in a random nonequiprobable graph
Diskr. Mat., 1990, Volume 2:3, 137–145
|
D. V. Korobitsyn
Complexity of some problems on hereditary classes of graphs
Diskr. Mat., 1990, Volume 2:3, 90–96
|
V. P. Korzhik, see V. B. Alekseev
Diskr. Mat., 1990, Volume 2:4, 97–115
|
M. M. Kovalev, A. V. Moshchenskii
An optimal search for extrema of convex functions on lattices
Diskr. Mat., 1990, Volume 2:1, 130–141
|
M. M. Kovalev, see V. A. Emelichev
Diskr. Mat., 1990, Volume 2:2, 127–137
|
A. G. Levin
Construction of minimal realizations of hypergraphs
Diskr. Mat., 1990, Volume 2:3, 102–114
|
M. I. Luganskaya
Almost optimal trees for computing logic functions
Diskr. Mat., 1990, Volume 2:1, 104–112
|
L. A. Lyapkov, B. A. Sevast'yanov
The probability distribution of the permanent of a random Boolean matrix
Diskr. Mat., 1990, Volume 2:2, 138–144
|
V. I. Malygin
Superpositions of automata and linear spaces connected with them
Diskr. Mat., 1990, Volume 2:1, 31–42
|
V. I. Malygin
The feedback operation and a class of group automata
Diskr. Mat., 1990, Volume 2:3, 81–89
|
A. A. Malyutin
Fast correlation decoding of some subsets of words of the first-order Reed–Muller code
Diskr. Mat., 1990, Volume 2:2, 155–158
|
S. S. Marchenkov
Representation of dictionary predicates from the arithmetical hierarchy
Diskr. Mat., 1990, Volume 2:1, 87–93
|
S. S. Marchenkov
Uniform id-decomposition of Boolean functions
Diskr. Mat., 1990, Volume 2:3, 29–41
|
E. E. Marenich
Comparisons modulo a prime for the number of $(0,1)$-matrices
Diskr. Mat., 1990, Volume 2:3, 153–157
|
A. A. Markov, T. G. Smirnova
On dictionary colorings and some perfect graphs
Diskr. Mat., 1990, Volume 2:2, 16–32
|
A. A. Markov
Systems of equations of the antiprefix property in words
Diskr. Mat., 1990, Volume 2:2, 3–15
|
V. D. Matveenko
Optimal trajectories of a dynamic programming scheme and extremal degrees of nonnegative matrices
Diskr. Mat., 1990, Volume 2:1, 59–71
|
Sh. A. Mirakhmedov
Randomized decomposable statistics in a scheme of independent allocation of particles into cells
Diskr. Mat., 1990, Volume 2:2, 97–111
|
A. N. Mirumyan, see A. S. Asratyan
Diskr. Mat., 1990, Volume 2:3, 21–28
|
V. V. Morozenko
Complexity of self-correcting algorithms for two search problems
Diskr. Mat., 1990, Volume 2:3, 50–55
|
A. V. Moshchenskii, see M. M. Kovalev
Diskr. Mat., 1990, Volume 2:1, 130–141
|
I. A. Muzychuk
On the nonexistence of even 4-critical graphs of order 12
Diskr. Mat., 1990, Volume 2:4, 47–59
|
A. S. Podkolzin, Š. M. Ušćumlić
Solution of systems of automaton equations
Diskr. Mat., 1990, Volume 2:1, 94–103
|
È. A. Primenko, È. F. Skvortsov
Conditions for regularity of finite autonomous automata
Diskr. Mat., 1990, Volume 2:1, 26–30
|
G. E. Puninskii
A finite system of axioms for the model companion of the theory of all multitrees
Diskr. Mat., 1990, Volume 2:4, 3–10
|
A. B. Ramazanov, see V. A. Emelichev
Diskr. Mat., 1990, Volume 2:2, 127–137
|
B. A. Sevast'yanov, see L. A. Lyapkov
Diskr. Mat., 1990, Volume 2:2, 138–144
|
I. I. Sharapudinov
Approximation properties of discrete Fourier sums
Diskr. Mat., 1990, Volume 2:2, 33–44
|
N. N. Sharov
Upper bounds for the capacity of discrete communication channels
Diskr. Mat., 1990, Volume 2:1, 155–157
|
V. S. Shevelev
Sums of subpermanents of linear hulls of permutation matrices
Diskr. Mat., 1990, Volume 2:3, 65–80
|
I. E. Shparlinski, see S. A. Stepanov
Diskr. Mat., 1990, Volume 2:3, 115–119
|
B. Shuster, see J. Hromkovič
Diskr. Mat., 1990, Volume 2:2, 121–126
|
È. F. Skvortsov, see È. A. Primenko
Diskr. Mat., 1990, Volume 2:1, 26–30
|
T. G. Smirnova, see A. A. Markov
Diskr. Mat., 1990, Volume 2:2, 16–32
|
V. D. Solov'ev
Closed classes in $k$-valued logic with an operation of branching by predicates
Diskr. Mat., 1990, Volume 2:4, 18–25
|
B. S. Stechkin
Embeddedness of partitions, distributions and weighings
Diskr. Mat., 1990, Volume 2:1, 113–129
|
S. A. Stepanov, I. E. Shparlinski
An estimate for the incomplete sum of multiplicative characters of polynomials
Diskr. Mat., 1990, Volume 2:3, 115–119
|
L. S. Stoikova
On conditions realizing the partitioning of the parameter domain in a Chebyshev extremal problem
Diskr. Mat., 1990, Volume 2:4, 11–17
|
A. S. Strogalov
Regular languages with polynomial growth in the number of words
Diskr. Mat., 1990, Volume 2:3, 145–152
|
V. E. Tarakanov
The edge independence number and the covering number for regular graphs
Diskr. Mat., 1990, Volume 2:1, 16–25
|
A. N. Timashev
Multidimensional local theorems on large deviations in an equiprobable allocation scheme
Diskr. Mat., 1990, Volume 2:2, 145–149
|
N. I. Turdaliev
Self-correcting schemes of functional elements for a linear function
Diskr. Mat., 1990, Volume 2:2, 150–154
|
R. I. Tyshkevich, see V. È. Zverovich
Diskr. Mat., 1990, Volume 2:2, 82–88
|
Š. M. Ušćumlić, see A. S. Podkolzin
Diskr. Mat., 1990, Volume 2:1, 94–103
|
A. D. Vainshtein
Construction of the minimal enclosing parallelogram
Diskr. Mat., 1990, Volume 2:4, 72–81
|
N. N. Vakhania
Construction of a truncated tree of variants for a general problem of scheduling theory
Diskr. Mat., 1990, Volume 2:3, 10–20
|
I. A. Vikhlyantsev
Self-correction for buffer switching circuits
Diskr. Mat., 1990, Volume 2:1, 80–86
|
S. M. Voronin
On the circle method
Diskr. Mat., 1990, Volume 2:2, 60–70
|
V. P. Voronin, see S. L. Bezrukov
Diskr. Mat., 1990, Volume 2:1, 50–58
|
Yu. I. Yanov
Lower bounds on computation time
Diskr. Mat., 1990, Volume 2:1, 142–154
|
Yu. V. Yatsishin
A lower bound on the register complexity of the computation of terms
Diskr. Mat., 1990, Volume 2:4, 60–62
|
S. P. Yukna
Functional approximations in the theory of lower bounds for circuit complexity
Diskr. Mat., 1990, Volume 2:2, 45–59
|
I. É. Zverovich, see V. È. Zverovich
Diskr. Mat., 1990, Volume 2:2, 82–88
|
V. È. Zverovich, I. É. Zverovich, R. I. Tyshkevich
Graphs with a matroid number that does not exceed 2
Diskr. Mat., 1990, Volume 2:2, 82–88
|
|
|
Contact us: