Computing partial information out of intractable: powers of algebraic numbers as an example

DOI10.1016/j.jnt.2009.08.009zbMath1251.11052OpenAlexW2081664556MaRDI 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

zbMATH Keywords

Baker theoryefficient computability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Linear forms in logarithms; Baker's method (11J86) Approximation to algebraic numbers (11J68)

Related Items (2)

Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers ⋮ On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing partial information out of intractable: powers of algebraic numbers as an example