You are here: TUCS > PUBLICATIONS > Publication Search > Computing Partial Information ...
- TUCS Publication Series
- How to Publish in TUCS Series
- Publication Search
- Publication Graph
- Publication Input
- Publication Input Guide
- JuFo Browser
Computing Partial Information Out of Uncomputable One - The first Digit of 2^n at Base 3 as an Example
Mika Hirvensalo, Juhani Karhumäki, Computing Partial Information Out of Uncomputable One - The first Digit of 2^n at Base 3 as an Example. TUCS Technical Reports 446, Turku Centre for Computer Science, 2002.
Abstract:
The problem of finding 2^n when n is given is mathematically trivial,
but computationally intractable. We show how to compute the most
significant digit of the ternary representation of 2^n in polynomial time.
Files:
Full publication in PDF-format
BibTeX entry:
@TECHREPORT{tHi02a,
title = {Computing Partial Information Out of Uncomputable One - The first Digit of
2^n at Base 3 as an Example},
author = {Hirvensalo, Mika and Karhumäki, Juhani},
number = {446},
series = {TUCS Technical Reports},
publisher = {Turku Centre for Computer Science},
year = {2002},
}
Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics