Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5, Number 3

RUS ENG

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

Series 1, 1998, Volume 5, Number 3

	Locally bounded hereditary subclasses of $k$-colorable graphs I. É. Zverovich		3
	Problems in scheduling theory on a single machine with job durations proportional to an arbitrary function A. V. Kononov		17
	Upper bounds for the complexity of symbol sequences generated by symmetric Boolean functions Yu. V. Merekin		38
	Minimal self-correcting schemes for a sequence of Boolean functions N. P. Red'kin		44
	On the problem of the maximum spanning tree of bounded radius A. I. Serdyukov		64
	Search costs and interval graphs F. V. Fomin		70
	Self-correcting schemes that realize “narrow” systems of linear Boolean functions A. V. Chashkin		80