Name
Abstract | ||
|---|---|---|
. While computer algebra systems have dealt with polynomials and rationalfunctions with integer coefficients for many years, dealing with more general constructsfrom commutative algebra is a more recent problem. In this paper we explain how onesystem solves this problem, what types and operators it is necessary to introduce and, inshort, how one can construct a computational theory of commutative algebra. Of necessity,such a theory is rather different from the conventional,... |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1007/3-540-52531-9_122 | DISCO |
Keywords | Field | DocType |
basic commutative algebra,computability theory | Subalgebra,Algebra,Incidence algebra,Pure mathematics,Difference algebra,Filtered algebra,Division algebra,Cellular algebra,Mathematics,Algebra representation,Symmetric algebra | Conference |
Volume | ISBN | Citations |
429 | 3-540-52531-9 | 21 |
PageRank | References | Authors |
1.63 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| James H. Davenport | 1 | 844 | 141.40 |
| Barry M. Trager | 2 | 614 | 97.81 |