Issue |
RAIRO-Theor. Inf. Appl.
Volume 49, Number 2, April-June 2015
|
|
---|---|---|
Page(s) | 139 - 152 | |
DOI | https://doi.org/10.1051/ita/2015003 | |
Published online | 27 April 2015 |
Towards using the history in online computation with advice∗
Department of Computer Science, ETH, 8092
Zürich,
Switzerland.
sacha.krug@inf.ethz.ch
Received:
30
September
2014
Accepted:
12
March
2015
Recently, advice complexity has been introduced as a new framework to analyze online algorithms. There, an online algorithm has access to an infinite binary advice tape during the computation. The contents of this tape were prepared beforehand by an omniscient oracle. One is interested in analyzing the number of accessed advice bits necessary and/or sufficient to achieve a certain solution quality. Among others, the bit guessing problem was analyzed in this framework. Here, an algorithm needs to guess a binary string bit by bit, either with or without getting immediate feedback after each bit. The bit guessing problem can be used to obtain lower bounds on the advice complexity of a variety of other online problems. In this paper, we analyze the difference between the two bit guessing variants. More precisely, we show that getting feedback after each request helps save advice bits when we allow errors to be made. This is by no means obvious – for optimality, both problem versions need the same amount of advice, and without advice, knowing the history does not help at all.
Mathematics Subject Classification: 68Q01 / 68W27
Key words: Online computation / bit guessing / advice complexity
© EDP Sciences 2015
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.