Diskr. Mat., 1990, Volume 2, Issue 3

Diskretnaya Matematika

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	General information
	Latest issue
	Archive
	Impact factor

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

Diskr. Mat.:
Year:
Volume:
Issue:
Page:
	Find

Personal entry:
Login:
Password:
	Save password
	Enter
	Forgotten password?
	Register

1990, Volume 2, Issue 3

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

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

Registration to the website

Logotypes