A New Algorithm for Long Integer Cube Computation with Some Insight into Higher Powers
From MaRDI portal
Publication:2914985
DOI10.1007/978-3-642-32973-9_4zbMath1373.11085OpenAlexW108734216WikidataQ56270826 ScholiaQ56270826MaRDI QIDQ2914985
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
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16)
Related Items (2)
Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers ⋮ 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