Computing partial information out of intractable: powers of algebraic numbers as an example
From MaRDI portal
Publication:1048926
DOI10.1016/j.jnt.2009.08.009zbMath1251.11052MaRDI QIDQ1048926
Alexander Rabinovich, Juhani Karhumäki, Mika Hirvensalo
Publication date: 8 January 2010
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jnt.2009.08.009
68Q25: Analysis of algorithms and problem complexity
11Y16: Number-theoretic algorithms; complexity
11J86: Linear forms in logarithms; Baker's method
11J68: Approximation to algebraic numbers
Related Items
On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1, Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers
Cites Work