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

RUS ENG

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

1990, Volume 2, Issue 1

	The method of Newton sums in problems of combinatorial optimization A. I. Barvinok		3
	The edge independence number and the covering number for regular graphs V. E. Tarakanov		16
	Conditions for regularity of finite autonomous automata È. A. Primenko, È. F. Skvortsov		26
	Superpositions of automata and linear spaces connected with them V. I. Malygin		31
	An asymptotic formula for the number of self-inverse labeled oriented graphs A. S. Ambrosimov		43
	Extremal ideals of the lattice of multisets for symmetric functionals S. L. Bezrukov, V. P. Voronin		50
	Optimal trajectories of a dynamic programming scheme and extremal degrees of nonnegative matrices V. D. Matveenko		59
	Universal labyrinth traps for finite sets of automata G. Kilibarda		72
	Self-correction for buffer switching circuits I. A. Vikhlyantsev		80
	Representation of dictionary predicates from the arithmetical hierarchy S. S. Marchenkov		87
	Solution of systems of automaton equations A. S. Podkolzin, Š. M. Ušćumlić		94
	Almost optimal trees for computing logic functions M. I. Luganskaya		104
	Embeddedness of partitions, distributions and weighings B. S. Stechkin		113
	An optimal search for extrema of convex functions on lattices M. M. Kovalev, A. V. Moshchenskii		130
	Lower bounds on computation time Yu. I. Yanov		142
	Upper bounds for the capacity of discrete communication channels N. N. Sharov		155