@inbook{5cfd184904c44c64bf3dc709f6981771,
title = "From logarithmic advice to single-bit advice",
abstract = "Building on Barak's work (Random'02), Fortnow and Santhanam (FOCS'04) proved a time hierarchy for probabilistic machines with one bit of advice. Their argument is based on an implicit translation technique, which allow to translate separation results for short (say logarithmic) advice (as shown by Barak) into separations for a single-bit advice. In this note, we make this technique explicit, by introducing an adequate translation lemma.",
author = "Oded Goldreich and Madhu Sudan and Luca Trevisan",
year = "2011",
doi = "https://doi.org/10.1007/978-3-642-22670-0_13",
language = "الإنجليزيّة",
isbn = "9783642226694",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "109--113",
editor = "Oded Goldreich",
booktitle = "Studies in Complexity and Cryptography",
}