Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-Reports 1992 Copyright 1992 University of Bonn, Department of Computer Science, Abt. V
8582

Computation of the Additive Complexity of Algebraic Circuits with Root Extracting
Dima Grigoriev, Marek Karpinski
[Download PostScript] [Download PDF]

We design an algorithm for computing the generalized (algebraic circuits with root extraction) {\em additive complexity} of any rational function. It is the first computability result of this sort on the additive complexity of algebraic circuits (cf. [SW 80]).

Last Change: 09/06/04 at 08:18:56
 Deutsch
University of Bonn -> Department of Computer Science -> Chair V