Although both CSE and GB algorithms aim to maximize the sharing of par- tial products, they differ in the search space that they explore. The CSE algo- rithms initially define the constants under a number representation. Then, all possible subexpressions are extracted from the representations of...
, Par- tial di erential equations with minimal smoothness and applications. Proceedings of the IMA Participating Institutions Conference held at the University of Chicago, Chicago, Illinois, March - , . The IMA Volumes in Mathematics and its Ap- plications, . Springer-Verlag, New York, , - ....