SIZE-DEPTH TRADEOFFS FOR ALGEBRAIC FORMULAE
dc.contributor.author | Eberly, Wayne | eng |
dc.contributor.author | Cleve, Richard | eng |
dc.contributor.author | Bshouty, Nader H. | eng |
dc.date.accessioned | 2008-02-26T20:31:36Z | |
dc.date.available | 2008-02-26T20:31:36Z | |
dc.date.computerscience | 1999-05-27 | eng |
dc.date.issued | 1992-05-01 | eng |
dc.description.abstract | We 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.notes | We 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.ca | eng |
dc.identifier.department | 1992-478-16 | eng |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30594 | |
dc.identifier.uri | http://hdl.handle.net/1880/45473 | |
dc.language.iso | Eng | eng |
dc.publisher.corporate | University of Calgary | eng |
dc.publisher.faculty | Science | eng |
dc.subject | Computer Science | eng |
dc.title | SIZE-DEPTH TRADEOFFS FOR ALGEBRAIC FORMULAE | eng |
dc.type | unknown | |
thesis.degree.discipline | Computer Science | eng |
Files
License bundle
1 - 1 of 1