Computing partial information out of intractable: powers of algebraic numbers as an example (Q1048926): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:01, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing partial information out of intractable: powers of algebraic numbers as an example |
scientific article |
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
