Computation of the Additive Complexity of Algebraic Circuits with Root Extracting

TitleComputation of the Additive Complexity of Algebraic Circuits with Root Extracting
Publication TypeTechnical Report
Year of Publication1992
AuthorsKarpinski, M., & Verbeek R.
Other Numbers784
Abstract

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]).

URLhttp://www.icsi.berkeley.edu/pubs/techreports/tr-92-079.pdf
Bibliographic Notes

ICSI Technical Report TR-92-079

Abbreviated Authors

M. Karpinski and R. Verbeek

ICSI Publication Type

Technical Report