LOGARITHMIC DEPTH CIRCUITS FOR HERMITE INTERPOLATION
dc.contributor.author | Eberly, Wayne | eng |
dc.date.accessioned | 2008-02-26T20:31:21Z | |
dc.date.available | 2008-02-26T20:31:21Z | |
dc.date.computerscience | 1999-05-27 | eng |
dc.date.issued | 1990-07-01 | eng |
dc.description.abstract | We 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.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 | 1990-397-21 | eng |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30591 | |
dc.identifier.uri | http://hdl.handle.net/1880/45470 | |
dc.language.iso | Eng | eng |
dc.publisher.corporate | University of Calgary | eng |
dc.publisher.faculty | Science | eng |
dc.subject | Computer Science | eng |
dc.title | LOGARITHMIC DEPTH CIRCUITS FOR HERMITE INTERPOLATION | eng |
dc.type | unknown | |
thesis.degree.discipline | Computer Science | eng |