1. The upper complexity bound of the shortest disjunctive normal forms of almost all Boolean functions

   • A. D. Korshunov

   OriginalPaper Pages: 705 - 715

2. On the choice of method for the computation of flows in nets on a computer

   • M. G. Sukharev

   OriginalPaper Pages: 716 - 718

3. Method of constructing a series of additively different numbers

   • G. S. Aloyan
   • A. G. Timoshenko

   OriginalPaper Pages: 719 - 724

4. Representation of partial Boolean functions

   • I. I. Brona

   OriginalPaper Pages: 725 - 727

5. Seminar on “Graphs and automata in computer settings. Homogeneous integrating structures”

   • V. I. Kekeliya
   • I. V. Safonov

   Scientific Information Pages: 728 - 728

6. The 1971 Ifip Congress Prospectus of Reports to be Presented

   Scientific Information Pages: 729 - 731