A new algebra core for the minimal form' problem
The demands of largescale algebraic computation have led to the development of many new algorithms for manipulating algebraic objects in computer algebra systems. For instance, parallel versions of many important algorithms have been discovered. Simultaneously, more effective symbolic representations of algebraic objects have been sought. Also, while some clever techniques have been found for improving the speed of the algebraic simplification process, little attention has been given to the issue of restructuring expressions, or transforming them into minimal forms.'' By minimal form,'' we mean that form of an expression that involves a minimum number of operations. In a companion paper, we introduce some new algorithms that are very effective at finding minimal forms of expressions. These algorithms require algebraic and combinatorial machinery that is not readily available in most algebra systems. In this paper we describe a new algebra core that begins to provide the necessary capabilities.
 Authors:

^{[1]};
;
^{[2]}
 (Institute for Defense Analyses, Princeton, NJ (United States). Center for Communications Research)
 (Lawrence Livermore National Lab., CA (United States))
 Publication Date:
 OSTI Identifier:
 5254684
 Report Number(s):
 UCRLJC109226; CONF9207604
ON: DE92011966
 DOE Contract Number:
 W7405ENG48
 Resource Type:
 Conference
 Resource Relation:
 Conference: International symposium on symbolic and algebraic computation, Berkeley, CA (United States), 2729 Jul 1992
 Research Org:
 Lawrence Livermore National Lab., CA (United States)
 Sponsoring Org:
 DOE; USDOE, Washington, DC (United States)
 Country of Publication:
 United States
 Language:
 English
 Subject:
 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; PROGRAMMING; ALGEBRA; ALGORITHMS; PARALLEL PROCESSING; MATHEMATICAL LOGIC; MATHEMATICS 990200*  Mathematics & Computers