Computability of the additive complexity of algebraic circuits with root extracting

DOI10.1016/0304-3975(95)00177-8MaRDI QIDQ1351701zbMATH OpenOpenAlexFDO

Authors Marek Karpinski, Dima Grigoriev

Publication date 27 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(95)00177-8

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Computing the Additive Complexity of Algebraic Circuits with Root Extracting
• Polynomials with Rational Coefficients Which are Hard to Compute
• Logarithmic Depth Circuits for Algebraic Functions
• Algebraic complexity theory. I: An introduction

Cites work

• scientific article; zbMATH DE number 421669 (Why is no real title available?)
• scientific article; zbMATH DE number 3135928 (Why is no real title available?)
• scientific article; zbMATH DE number 49991 (Why is no real title available?)
• scientific article; zbMATH DE number 1273635 (Why is no real title available?)
• A Structure Theorem for Exponential and Primitive Functions
• Additive Complexity and Zeros of Real Polynomials
• Additive complexity in directed computations
• Complexity of quantifier elimination in the theory of ordinary differential equations
• Computational Complexity of Sparse Rational Interpolation
• Computational complexity of algebraic functions
• Lower bounds in algebraic computational complexity
• On Computing Algebraic Functions Using Logarithms and Exponentials
• On Liouville's theory of elementary functions
• On the additive complexity of polynomials
• VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions

This page was built for publication: Computability of 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 Q1351701)