TY  - JOUR
AU  - Casas, Rafael
AU  - Fernández Camacho, María Inés
AU  - Steyaert, Jean-Marc
PY  - 1990
DO  - 10.1016/0304-3975(90)90078-V
SN  - 0304-3975
UR  - https://hdl.handle.net/20.500.14352/58384
T2  - Theoretical Computer Science
AB  - We consider a class of simplification algorithms for algebraic and logical expressions which are of systematic use in computer algebra systems. This class is basically characterized by the fact that algorithms operate in a bottom-up recursive way on...
LA  - eng
M2  - 273
PB  - Elsevier Science
KW  - Symbolic computation
KW  - algebraic computation
KW  - Mechanization of proofs and logical operations
TI  - Algebraic simplification in computer algebra: an analysis of bottom-up algorithms
TY  - journal article
VL  - 74
ER  -