Computability of the additive complexity of algebraic circuits with root extracting

AbstractWe design an algorithm for computing the generalized (i.e. for algebraic circuits with root extracting, cf. [9, 10, 13]) additive complexity of any rational function. It is the first computability result of this sort on the additive complexity of algebraic circuits