KANAYeVA N. Research Local Algorithm for Decision of Boolean Programming Block Problems.

3. The computational complexity of local algorithms for solving block and quasi-block Boolean programming problems is the research object. The research aim is to define the average estimates of local algorithm computational complexity, to define the best and the worst structures of the problems. The research methods are the combinatorial analyses method, the majorization theory, a calculating experimet. It is shown, that local algorithm is concrete realization of V.Mikhalevich-N.Shor's method of sequential construction, analyzing and avoiding of variants. It is shown, that mean value of computational complexity of local algorithm is quasiexponential function of a number of variables.The extremal estimate values of local algorithm computational complexityat the class of the block and quasi-block Boolean programming problems. The sphere of using: the applied problems of economic and control management.