Computing partial information out of intractable: powers of algebraic numbers as an example (Q1048926)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5654993
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing partial information out of intractable: powers of algebraic numbers as an example |
scientific article; zbMATH DE number 5654993 |
Statements
Computing partial information out of intractable: powers of algebraic numbers as an example (English)
0 references
8 January 2010
0 references
The paper contains efficient algorithms for computing the leftmost digit in base 3 of the numbers \(2^n\) and the Fibonacci number \(F_n\). Using Baker's estimates on linear forms in logarithms, the authors prove that these two problems can be solved in polynomial time with respect to the length of \(n\).
0 references
efficient computability
0 references
Baker theory
0 references
0.7668930888175964
0 references
0.7467240691184998
0 references
0.7107582092285156
0 references
