1. R. G. Nigmatullin, An algorithm of the fastest descent in the set covering problem. In: Proc. Symp. on Approximation Algorithms. Kiev, 1969, p. 36 (in Russian).
2. N. N. Kuzyurin, Asymptotically exact polynomial algorithm for a class of Boolean linear programs. In: Proc 3rd All-Union School `Discrete Optimization and Computers'. CEMI, Moscow, 1987, p. 129 (in Russian).
3. A. A. Sapozhenko, On a proof of upper bound of the size of minimal DNF for almost all functions. In: Abstr. 1st All-Union Conf. on Problems in Theoretical Cybern. Novosibirsk, 1969, p. 103 (in Russian).
4. A. A. Sapozhenko, On the size of DNF obtained by the greedy algorithm. Discrete Analysis (1972) No. 5, 111-116 (in Russian).