| dc.contributor.author | Fateman, Richard J. | en_US |
| dc.date.accessioned | 2023-03-29T14:55:54Z | |
| dc.date.available | 2023-03-29T14:55:54Z | |
| dc.date.issued | 1972-04 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149407 | |
| dc.description.abstract | This thesis consists of essays on several aspects of the problem of algebraic simplification by computer. Since simplification is at the core of most algebraic manipulations, efficient and effective simplification procedures are essential to building useful computer systems for non-numerical mathematics. Efficiency is attained through carefully designed and engineered algorithms, heuristics,and data types, while effectiveness is assured through theoretical considerations. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-095 | |
| dc.relation.ispartofseries | MAC-TR-095 | |
| dc.title | Essays in Algebraic Simplification | en_US |
| dc.identifier.oclc | 00731329 | |
