Diskr. Mat., 1991, Volume 3, Issue 1

RUS ENG

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

1991, Volume 3, Issue 1

	Perfect codes in the metric of deletions and insertions V. I. Levenshtein	3
	Combinatorial-symmetric analysis of multidimensional random walks L. A. Pomortsev	21
	On the complexity of sorting of Boolean algebra V. V. Morozenko	42
	Boolean functions that are difficult to realize and real numbers that are difficult to evaluate S. B. Gashkov	48
	On the probability of the first passage into a fixed state for a random walk on a half-line V. I. Afanasyev	61
	Incomplete Gaussian sums in finite fields G. I. Perel'muter	68
	On the coding of semilattices and automata on semilattices G. P. Agibalov	74
	On the simplification of Boolean functions with a set of zeros of a special type A. N. Nurlybaev	88
	On the connection between optima in linear and integer linear programming problems N. N. Kuzyurin	98
	On the design of an automaton for traversing plane labyrinths with limited holes A. N. Zyrichev	105
	Binomial moments and exponential generating functions M. N. Rokhlin	114
	Isomorphisms of incidence algebras V. D. Shmatkov	133
	Sufficient conditions for asymptotic normality of decomposable statistics in an inhomogeneous allocation scheme E. E. D'yakonova, V. G. Mikhailov	145

Information
	Review of a book, R. L. Graham, D. E. Knuth, O. Patashnik “Concrete mathematics. A foundation for computer science” B. B. Pokhodzei	155