On Computing Algebraic Functions Using Logarithms and Exponentials

DOI10.1137/S0097539793245015MaRDI QIDQ4834378zbMATH OpenOpenAlexFDO

Authors Michael F. Singer, Andrew Chi-Chih Yao, Dima Grigoriev

Publication date 18 March 1996

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

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

zbMATH Keywords

algebraic expressionsJordan-Hölder tower

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Computing splitting fields using Galois theory and other Galois constructions
• Symmetric Functions, m-Sets, and Galois Groups
• Decomposition of algebraic functions
• scientific article; zbMATH DE number 4128945
• Computing the Additive Complexity of Algebraic Circuits with Root Extracting

Cited in

(3)

• Computability of the additive complexity of algebraic circuits with root extracting
• Complexity lower bounds for computation trees with elementary transcendental function gates
• scientific article; zbMATH DE number 619537 (Why is no real title available?)

This page was built for publication: On Computing Algebraic Functions Using Logarithms and Exponentials

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