Show simple item record

dc.contributor.authorEberly, Wayneeng
dc.date.accessioned2008-02-26T20:31:21Z
dc.date.available2008-02-26T20:31:21Z
dc.date.issued1990-07-01eng
dc.identifier.urihttp://hdl.handle.net/1880/45470
dc.description.abstractWe present a new parallel algorithm for Hermite interpolation. The algorithm can be implemented using arithmetic-boolean circuits of depth logarithmic and size polynomial in the input size. A corresponding Boolean algorithm can be used to compute the coefficients of the Hermite interpolating polynomial from binary representations of evaluation points and derivatives over finite fields and number fields, using a P-uniform family of circuits of depth logarithmic in the input size and of polynomial size.eng
dc.language.isoEngeng
dc.subjectComputer Scienceeng
dc.titleLOGARITHMIC DEPTH CIRCUITS FOR HERMITE INTERPOLATIONeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
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.department1990-397-21eng
dc.date.computerscience1999-05-27eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30591
thesis.degree.disciplineComputer Scienceeng


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record