Computability of the additive complexity of algebraic circuits with root extracting

Dima Grigoriev,Marek Karpinski

doi:10.1016/0304-3975(95)00177-8

Computability of the additive complexity of algebraic circuits with root extracting

Dima Grigoriev, Marek Karpinski

Open Access

https://doi.org/10.1016/0304-3975(95)00177-8

Copy DOI

Journal: Theoretical Computer Science	Publication Date: Apr 1, 1996
Citations: 3	License type: other-oa

Affiliation: Steklov Mathematical Institute, Pennsylvania State University, University of Bonn

#Root Extracting #Algebraic Circuits + Show 4 more

Abstract
Full-Text PDF
Similar Papers

Abstract

We 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.

Full Text