Computing the Additive Complexity of Algebraic Circuits with Root Extracting

DOI10.1137/S0097539793258313MaRDI QIDQ4388894zbMATH OpenFDO

Authors Dima Grigoriev, Marek Karpinski

Publication date 10 May 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539793258313

zbMATH Keywords

additive complexityalgebraic circuitsminimal computationroot extracting

Mathematics Subject Classification ID

Real rational functions (26C15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Computability of the additive complexity of algebraic circuits with root extracting
• Logarithmic Depth Circuits for Algebraic Functions
• Circuits for computing the GCD of two polynomials over an algebraic number field
• scientific article; zbMATH DE number 953020
• Complexity of computation on real algebraic numbers

Cited in

(2)

• Computability of the additive complexity of algebraic circuits with root extracting
• On Computing Algebraic Functions Using Logarithms and Exponentials

This page was built for publication: Computing the Additive Complexity of Algebraic Circuits with Root Extracting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388894)