MAS (Modula-2 Algebra System) is an experimental computer algebra system (CAS), developed at the University of Passau. MAS combines imperative programming facilities with algebraic specification capabilities for design and study of algebraic algorithms. It contains a large library of implemented Groebner basis algorithms for nearly all algebraic structures where such methods exist. MAS further includes algorithms for real quantifier elimination, parametric real root counting, and for computing in (noncommutative) polynomial rings.
Keywords for this software
References in zbMATH (referenced in 5 articles )
Showing results 1 to 5 of 5.
- Li, Huishi: On computation of minimal free resolutions over solvable polynomial algebras. (2015)
- Kredel, Heinz: Comprehensive Gröbner bases in a Java computer algebra system (2014)
- Green, Edward L.; Solberg, Øyvind: An algorithmic approach to resolutions (2007)
- Levandovskyy, Viktor: \textscPlural, a non-commutative extension of \textscSingular: past, present and future. (2006)
- Göbel, Manfred: The invariant package of MAS (1997)