We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

On the Complexity of Computing Algebraic Functions

Thumbnail Image
Download
Name

MIT-LCS-TR-481.pdf

Size

3.13 MB

Format

Adobe PDF

Checksum (MD5)

a9550b031eff4321b5a2d204d2b1ca5f

Author(s)
Mansour, Yishay
Date Issued
September 1990
Series/Report no.
MIT-LCS-TR-481
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.