Computing Partial Information out of Intractable One - The First Digit of 2 n at Base 3 as an Example

Authors:
Mika Hirvensalo;Juhani Karhumäki
Affiliations:
-;-
Venue:
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Year:
2002

Citing 1
Cited 1

Pade´ approximants and effective measures of irrationality

Progress in mathematics; Vol. 71 on Seminaire de theorie des monbres, Paris 1985-86

Weak minimization of DFA: an algorithm and applications

Theoretical Computer Science - Implementation and application of automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of finding 2n when n is given is mathematically trivial, but computationally intractable. We show how to compute the most significant digit of the ternary representation of 2n in polynomial time.