Diskretn. Anal. Issled. Oper., 2010, Volume 17, Number 5

RUS ENG

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

2010, Volume 17, Number 5

	A family of two-dimensional words with maximal pattern complexity $2k$ Ts. Ch.-D. Batueva		3
	On reconstruction of binary codes by dimensions of their subcodes E. V. Gorkunov, S. V. Avgustinovich		15
	List 2-distance $(\Delta+1)$-coloring of planar graphs with girth at least 7 A. O. Ivanova		22
	NP-completeness of some problems of a vectors subset choice A. V. Kel'manov, A. V. Pyatkin		37
	Cycles of length seven in the pancake graph E. V. Konstantinova, A. N. Medvedev		46
	Multiplicative circulant networks E. A. Monakhova		56
	A rule for the addition of entropies for underdetermined data L. A. Sholomov		67