The upper complexity bound of the shortest disjunctive normal forms of almost all Boolean functions A. D. Korshunov OriginalPaper Pages: 705 - 715
On the choice of method for the computation of flows in nets on a computer M. G. Sukharev OriginalPaper Pages: 716 - 718
Method of constructing a series of additively different numbers G. S. AloyanA. G. Timoshenko OriginalPaper Pages: 719 - 724
Seminar on “Graphs and automata in computer settings. Homogeneous integrating structures” V. I. KekeliyaI. V. Safonov Scientific Information Pages: 728 - 728