The MIT Libraries is completing a major upgrade to DSpace@MIT. Starting May 5 2026, DSpace will remain functional, viewable, searchable, and downloadable, however, you will not be able to edit existing collections or add new material. We are aiming to have full functionality restored by May 18, 2026 but intermittent service interruptions may occur. Please email dspace-lib@mit.edu
with any questions. Thank you for your patience as we implement this important upgrade.
On the Complexity of Computing Algebraic Functions
| dc.contributor.author | Mansour, Yishay | en_US |
| dc.date.accessioned | 2023-03-29T15:16:55Z | |
| dc.date.available | 2023-03-29T15:16:55Z | |
| dc.date.issued | 1990-09 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149692 | |
| dc.description.abstract | This research addresses the problem of proving lower bounds on the complexity of algebraic computations involving the floor operation. The model of computation considered is a computation tree with the set of basic operations {+,-,*,*,[.],._ }. The constants available to the computation are 0 and 1, and every other constant needs to be generated explicitly. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-481 | |
| dc.title | On the Complexity of Computing Algebraic Functions | en_US |
| dc.identifier.oclc | 22572272 |
