Computability of the additive complexity of algebraic circuits with root extracting
From MaRDI portal
Publication:1351701
DOI10.1016/0304-3975(95)00177-8zbMath0871.68085OpenAlexW2013243823MaRDI QIDQ1351701
Marek Karpinski, Dima Yu. 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds in algebraic computational complexity
- On the additive complexity of polynomials
- Computational complexity of algebraic functions
- Additive complexity in directed computations
- On Liouville's theory of elementary functions
- A Structure Theorem for Exponential and Primitive Functions
- VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions
- Computational Complexity of Sparse Rational Interpolation
- On Computing Algebraic Functions Using Logarithms and Exponentials
- Additive Complexity and Zeros of Real Polynomials
- Complexity of quantifier elimination in the theory of ordinary differential equations
This page was built for publication: Computability of the additive complexity of algebraic circuits with root extracting