İçeriğe geç
akaturk Akademik ölçüm
Giriş yap Kayıt ol

OpenAlex konusu

Polynomial and algebraic computation

Bu sayfa OpenAlex konu etiketine göre çalışmaları ve o konuda görünen akademisyenleri listeler. YÖKSİS temel alan / yan dal değildir.

OpenAlex 695 eser 41 yazar konusu

Çalışmalar

695 eser

  1. Mastrovito multiplier for all trinomials 1999
    YÖKSİS SJR Q2 JCR Q1 OpenAlex üst %10 OpenAlex 98.7%

    An efficient algorithm for the multiplication in GF(2/sup m/) was introduced by Mastrovito. The space complexity of the Mastrovito multiplier for the irreducible trinomial x/sup m/+x+1 was given as m/sup 2/-1 XOR and m/sup 2/ AND gales. In this paper, we describe an architecture based on a new formulation of the multi…

  2. Mastrovito multiplier for general irreducible polynomials 2019
    YÖKSİS SJR Q1 JCR Q2 OpenAlex üst %10 OpenAlex 97.0%

    We present a new formulation of the Mastrovito multiplication matrix for the field GF(2/sup m/) generated by an arbitrary irreducible polynomial. We study in detail several specific types of irreducible polynomials, e.g., trinomials, all-one-polynomials, and equally-spaced-polynomials, and obtain the time and space co…

  3. Multiplicative type complex calculus as an alternative to the classical calculus 2010
    YÖKSİS OpenAlex üst %10 OpenAlex 90.1%

    Özet henüz yok.

  4. Topological properties of real algebraic varieties: du coté de chez Rokhlin 2000
    OpenAlex üst %10 OpenAlex 93.7%

    The survey gives an overview of the achievements in topology of real algebraic varieties in the direction initiated in the early 70th by V.I.Arnold and V.A.Rokhlin. We make an attempt to systematize the principal results in the subject. After an exposition of general tools and results, special attention is paid to sur…

  5. Persistence and stability properties of powers of ideals 2015
    YÖKSİS SJR Q1 JCR Q2 OpenAlex üst %10 OpenAlex 98.8%

    Özet henüz yok.

  6. Instruction Set Extensions for Fast Arithmetic in Finite Fields GF(p) and GF(2 m ) 2004
    YÖKSİS SJR Q2 JCR Q4 OpenAlex üst %10 OpenAlex 92.9%

    Özet henüz yok.

  7. Energy-Efficient Software Implementation of Long Integer Modular Arithmetic 2005
    YÖKSİS SJR Q2 JCR Q4 OpenAlex 79.3%

    Özet henüz yok.

  8. Ideals generated by 2 minors collections of cells and stack polyominoes 2012
    YÖKSİS SJR Q1 JCR Q2 OpenAlex üst %10 OpenAlex 98.5%

    Özet henüz yok.

  9. A COMMON SOLUTION TO A PAIR OF LINEAR MATRIX EQUATIONS OVER A PRINCIPAL IDEAL DOMAIN 1991
    YÖKSİS SJR Q2 JCR Q3 OpenAlex 15.9%

    Özet henüz yok.

  10. An improvement on Fibonacci search method in optimization theory 2004
    YÖKSİS SJR Q2 JCR Q3 OpenAlex 81.0%

    Özet henüz yok.

  11. An improvement on Fibonacci search method in optimization theory 2004
    YÖKSİS SJR Q2 JCR Q3 OpenAlex 81.0%

    Özet henüz yok.

  12. The Determination of Implicit Polynomial Canonical Curves 1998
    YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 93.0%

    A new method is presented for identifying and comparing closed, bounded, free-form curves that are defined by even implicit polynomial (IP) equations in the X-Y Cartesian coordinates. The method provides a new expression for an IP involving a product of conic factors with unique conic factor centers. The critical poin…

Akademisyenler

41 akademisyen