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

DOI10.1007/978-3-642-32973-9_4zbMATH Open1373.11085DBLPconf/casc/BodratoZ12OpenAlexW108734216WikidataQ56270826 ScholiaQ56270826MaRDI QIDQ2914985FDOQ2914985

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

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

zbMATH Keywords

cubelong integersthird powerToom-Cook method

Mathematics Subject Classification ID

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

Cited In (4)

• Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers
• Fast ideal cubing in imaginary quadratic number and function fields
• Taking cube roots in \(\mathbb Z_{m}\)
• Bounds for polynomials on algebraic numbers and application to curve topology

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)