Skip to content
akaturk Academic measurement

OpenAlex topic

Polynomial and algebraic computation

This page lists works and academicians tagged with an OpenAlex topic. It is not a YÖKSİS primary or secondary field.

OpenAlex 695 works 41 author topics

Works

695 works

  1. YÖKSİS SJR Q2 JCR Q1 OpenAlex top 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. YÖKSİS SJR Q1 JCR Q2 OpenAlex top 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. YÖKSİS SJR Q1 JCR Q1 OpenAlex top 10% OpenAlex 90.1%

    No abstract yet.

  4. OpenAlex top 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. YÖKSİS SJR Q1 JCR Q2 OpenAlex top 10% OpenAlex 98.8%

    No abstract yet.

  6. YÖKSİS SJR Q2 JCR Q4 OpenAlex top 10% OpenAlex 92.9%

    No abstract yet.

  7. YÖKSİS SJR Q2 JCR Q4 OpenAlex 79.3%

    No abstract yet.

  8. YÖKSİS SJR Q1 JCR Q2 OpenAlex top 10% OpenAlex 98.5%

    No abstract yet.

  9. YÖKSİS SJR Q2 JCR Q3 OpenAlex 15.9%

    No abstract yet.

  10. YÖKSİS SJR Q2 JCR Q3 OpenAlex 81.0%

    No abstract yet.

  11. YÖKSİS SJR Q2 JCR Q3 OpenAlex 81.0%

    No abstract yet.

  12. YÖKSİS SJR Q1 JCR Q1 OpenAlex top 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…

Academicians

41 academicians