BIBasis, a package for reduce and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases
| Autor: | M. V. Zinin |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Theoretical computer science
Mathematics::Commutative Algebra Symbolic computation Boolean algebra Boolean domain Algebra symbols.namesake ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION Computer Science::Mathematical Software symbols Computer Science::Symbolic Computation User interface Implementation Software Mathematics |
| Zdroj: | Programming and Computer Software. 38:92-101 |
| ISSN: | 1608-3261 0361-7688 |
| DOI: | 10.1134/s0361768812020077 |
| Popis: | In this paper, we describe the BIBasis package designed for REDUCE and Macaulay2 computer algebra systems, which allows one to compute Boolean involutive bases and Grobner bases. The implementations and user interfaces of the package for both systems are described in the respective sections of the paper. Also, we present results of comparisons of BIBasis with other packages and algorithms for constructing Boolean Grobner bases available in the computer algebra systems. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink