1. Remark on minimization of depth of Boolean circuits

   • S. B. Gashkov

   OriginalPaper Pages: 87 - 89

2. Implicit completeness in the k-valued logic

   • O. M. Kasim-Zade

   OriginalPaper Pages: 90 - 94

3. The maximal complexity of calculations of systems of elements of a free Abelian group

   • V. V. Kochergin

   OriginalPaper Pages: 95 - 100

4. Synthesis of formulas whose complexity and depth do not exceed the asymptotically best estimates of high degree of accuracy

   • S. A. Lozhkin

   OriginalPaper Pages: 101 - 107

5. The depth of decision trees for binary problems

   • M. Yu. Moshkov

   OriginalPaper Pages: 108 - 111

6. Synthesis of easily tested circuits in some infinite basis

   • N. P. Red’kin

   OriginalPaper Pages: 112 - 115

7. The number of independent sets in graphs

   • A. A. Sapozhenko

   OriginalPaper Pages: 116 - 118

8. Realization of graphs in a subspace of bounded height

   • A. V. Chashkin

   OriginalPaper Pages: 119 - 123