1. The complexity and depth of Boolean circuits for multiplication and inversion in some fields GF(2 ⁿ )

   • S. B. Gashkov
   • I. S. Sergeev

   OriginalPaper 03 September 2009 Pages: 139 - 143

2. Relation between two measures of the computation complexity for systems of monomials

   • V. V. Kochergin

   OriginalPaper 03 September 2009 Pages: 144 - 149

3. Uniform Morse lemma and isotopy criterion for Morse functions on surfaces

   • E. A. Kudryavtseva

   OriginalPaper 03 September 2009 Pages: 150 - 158

4. Expansion over a system of shifts of pyramidal functions

   • T. P. Lukashenko
   • S. M. Lytkin

   OriginalPaper 03 September 2009 Pages: 159 - 164

5. An elementary proof of the irrationality of ζ(3)

   • Yu. V. Nesterenko

   OriginalPaper 03 September 2009 Pages: 165 - 171

6. Localization of small zeros of sine and cosine Fourier transforms of a finite positive nondecreasing function

   • A. M. Sedletskii

   OriginalPaper 03 September 2009 Pages: 172 - 177