On the algebraic complexity of rational iteration procedures

DOI10.1016/0304-3975(91)90380-KzbMath0734.68045OpenAlexW2093874522MaRDI QIDQ811125

Walter Baur

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90380-k

zbMATH Keywords

algebraic complexity theoryrational iteration procedure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Unnamed Item
• Unnamed Item
• On polynomials with symmetric Galois group which are easy to compute
• Lower bounds for polynomials with algebraic coefficients
• A bound on the multiplicative efficiency of iteration
• Efficient Iterations for Algebraic Numbers
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials