| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 675 2 |
| Ultima descărcare din IBN: 2017-04-27 14:36 |
| Căutarea după subiecte similare conform CZU |
| 512.7+519.6 (3) |
| Algebră (400) |
| Matematică computațională. Analiză numerică. Programarea calculatoarelor (123) |
 SM ISO690:2012LI, Huishi. A Note on Solvable Polynomial Algebras. In: Computer Science Journal of Moldova, 2014, nr. 1(64), pp. 99-109. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 1(64) / 2014 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 512.7+519.6 | ||||||
| Pag. 99-109 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
In terms of their defining relations, solvable polynomial alge-
bras introduced by Kandri-Rody and Weispfenning [J. Symbolic
Comput., 9(1990)] are characterized by employing Gröbner bases
of ideals in free algebras, thereby solvable polynomial algebras are completely determinable and constructible in a computational
way. |
||||||
| Cuvinte-cheie PBW basis, Monomial ordering, GrÄobner basis, Solvable polynomial algebra |
||||||
|
|
|
|
