Computing Bits of Algebraic Numbers

DOI10.1007/978-3-642-29952-0_22zbMath1354.68117arXiv1112.4295OpenAlexW1868127001MaRDI QIDQ2898030

Samir Datta, Rameshwar Pratap

Publication date: 16 July 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.4295

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic number theory computations (11Y40) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1

This page was built for publication: Computing Bits of Algebraic Numbers