We report on some experience with a new version of the well known Gröbner algorithm with factorization and constraint inequalities, implemented in our REDUCE package CALI, [12]. We discuss some of its details and present run time comparisons with other existing implementations on well splitting examples.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:32811 |
| Date | 25 January 2019 |
| Creators | Gräbe, Hans-Gert |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/publishedVersion, doc-type:conferenceObject, info:eu-repo/semantics/conferenceObject, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | 981-02-2319-6 |
Page generated in 0.0022 seconds