SIZE-DEPTH TRADEOFFS FOR ALGEBRAIC FORMULAE

Simple item page
dc.contributor.authorEberly, Wayneeng
dc.contributor.authorCleve, Richardeng
dc.contributor.authorBshouty, Nader H.eng
dc.date.accessioned2008-02-26T20:31:36Z
dc.date.available2008-02-26T20:31:36Z
dc.date.computerscience1999-05-27eng
dc.date.issued1992-05-01eng
dc.description.abstractWe prove some tradeoffs between the size and depth of algebraic formulae. In particular, we show that, for any fixed $ epsilon~>~O$, any algebraic formula of size \s+1Ss-1 can be converted into an equivalent formula of depth $\s+1O\s-1 (log \s+1S\s-1)$ and size $O(S sup {1+ epsilon})$. This result is an improvement over previously-known results where, to obtain the same depth bound, the formula-size is $ OMEGA (S sup alpha )$, with $ alpha~>=~2$.eng
dc.description.notesWe are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.caeng
dc.identifier.department1992-478-16eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30594
dc.identifier.urihttp://hdl.handle.net/1880/45473
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleSIZE-DEPTH TRADEOFFS FOR ALGEBRAIC FORMULAEeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 2 of 2
Thumbnail Image
Name:
1992-478-16.pdf
Size:
218.06 KB
Format:
Adobe Portable Document Format
Download
No Thumbnail Available
Name:
1992-478-16.ps.gz
Size:
110.16 KB
Format:
Unknown data format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications