Details:
Title | Plural - a computer algebra system for noncommutative polynomial algebras | Author(s) | Viktor Levandovskyy, Hans | Text | Plural - a computer algebra system for noncommutative polynomial algebras | Type | Article in Conference Proceedings | Abstract | \textsc{Singular} is a computer algebra system developed for efficient
computations with polynomials. We describe \textsc{Plural} as an extension
of \textsc{Singular} to noncommutative polynomial rings (G--/GR--algebras):
to which structures does it apply, the prerequisites
to monomial orderings, left- and two--sided Gr\"obner bases.
The usual criteria to avoid "useless pairs" are revisited
for their applicability in the case of G--/GR--algebras.
Benchmark tests are used to evaluate the concepts compare them with
other systems.
| Length | 8 | ISBN | 1-58113-641-2/pbk |
URL |
http://doi.acm.org/10.1145/860854.860895 |
Language | English | Pages | 176-183 | Publisher | ACM Press | Address | New York, NY, USA | Year | 2003 | Editor | Sendra, J. Rafael | Edition | 0 | Translation |
No | Refereed |
Yes | Conferencename | ISSAC 2003 |
|