All Stories

  1. Arithmetic complexity of the Stirling transforms

    Article • Discrete Mathematics and Applications, January 2015, De Gruyter

    Sergey Gashkov

  2. Llower bounds for the complexity of monotone arithmetic circuits computing real polynomials

    Article • Sbornik Mathematics, October 2012, Turpion-Moscow Limited

    Sergey Gashkov

  3. Realization of Boolean functions by formulas in continuous bases containing a continuum of constants

    Article • Математические заметки, January 2012, Steklov Mathematical Institute

    Sergey Gashkov

  4. Complexity of approximate realizations of Lipschitz functions by schemes in continuous bases

    Article • Математические заметки, January 2012, Steklov Mathematical Institute

    Sergey Gashkov

  5. On design of circuits of logarithmic depth for inversion in finite fields

    Article • Дискретная математика, January 2008, Steklov Mathematical Institute

    Sergey Gashkov

  6. Berlekamp—Massey Algorithm, Continued Fractions, Pade Approximations, and Orthogonal Polynomials

    Article • Математические заметки, January 2006, Steklov Mathematical Institute

    Sergey Gashkov

  7. An application of the method of additive chains to inversion in finite fields

    Article • Дискретная математика, January 2006, Steklov Mathematical Institute

    Sergey Gashkov

  8. On the complexity of calculation of differentials and gradients

    Article • Дискретная математика, January 2005, Steklov Mathematical Institute

    Sergey Gashkov

  9. On the complexity of calculation of differentials and gradients

    Article • Discrete Mathematics and Applications, January 2005, De Gruyter

    Sergey Gashkov

  10. Упрощенное обоснование вероятностного теста Миллера - Рабина для проверки простоты чисел

    Article • Дискретная математика, January 1998, Steklov Mathematical Institute

    Sergey Gashkov