Publication Details
Title: Computation of the Additive Complexity of Algebraic Circuits with Root Extracting
Author: M. Karpinski and R. Verbeek
Group: ICSI Technical Reports
Date: November 1992
PDF: http://www.icsi.berkeley.edu/pubs/techreports/tr-92-079.pdf
Overview:
We design an algorithm for computing the generalized (algebraic circuits with root extraction) "additive complexity" of any rational function. It is the first computability result of this sort on the additive complexity of algebraic circuits (cf. [SW80]).
Bibliographic Information:
ICSI Technical Report TR-92-079
Bibliographic Reference:
M. Karpinski and R. Verbeek. Computation of the Additive Complexity of Algebraic Circuits with Root Extracting. ICSI Technical Report TR-92-079, November 1992
Author: M. Karpinski and R. Verbeek
Group: ICSI Technical Reports
Date: November 1992
PDF: http://www.icsi.berkeley.edu/pubs/techreports/tr-92-079.pdf
Overview:
We design an algorithm for computing the generalized (algebraic circuits with root extraction) "additive complexity" of any rational function. It is the first computability result of this sort on the additive complexity of algebraic circuits (cf. [SW80]).
Bibliographic Information:
ICSI Technical Report TR-92-079
Bibliographic Reference:
M. Karpinski and R. Verbeek. Computation of the Additive Complexity of Algebraic Circuits with Root Extracting. ICSI Technical Report TR-92-079, November 1992