A New Algorithm for Long Integer Cube Computation with Some Insight into Higher Powers

DOI10.1007/978-3-642-32973-9_4MaRDI QIDQ2914985zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Marco Bodrato, Alberto Zanoni

Publication date 21 September 2012

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32973-9_4

zbMATH Keywords

cubelong integersthird powerToom-Cook method

Mathematics Subject Classification ID

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

Recommendations

• The integer cubic algorithm
• A fast algorithm to compute cubic fields
• New cube root algorithm based on the third order linear recurrence relations in finite fields
• Precision, complexity, and computational schemes of the cubic algorithms
• New techniques for linear arithmetic: cubes and equalities
• Large integer multiplication on hypercubes
• An algorithm to compute relative cubic fields
• scientific article; zbMATH DE number 2154289
• scientific article; zbMATH DE number 1113821

Cited in

(4)

• Taking cube roots in \(\mathbb Z_{m}\)
• Bounds for polynomials on algebraic numbers and application to curve topology
• Univariate real root isolation over a single logarithmic extension of real algebraic numbers
• Fast ideal cubing in imaginary quadratic number and function fields

This page was built for publication: A New Algorithm for Long Integer Cube Computation with Some Insight into Higher Powers

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