نتایج جستجو برای: basis polynomials
تعداد نتایج: 417956 فیلتر نتایج به سال:
Standard noncommutative Gröbner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes Gröbner basis procedures for one-sided ideals in finitely presented noncommutative algebras over fields. The polynomials defining a K-algebra A as a quotient of a free K-algebra are combined with the polynomials defining a one-sided ideal I of ...
Formal verification utilizing symbolic computer algebra has demonstrated the ability to formally verify large Galois field arithmetic circuits and basic architectures of integer arithmetic circuits. The technique models the circuit as Gröbner basis polynomials and reduces the polynomial equation of the circuit specification wrt. the polynomials model. However, during the Gröbner basis reduction...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید