From logarithmic advice to single-bit advice

Oded Goldreich, Madhu Sudan, Luca Trevisan

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

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.

Original languageEnglish
Title of host publicationStudies in Complexity and Cryptography
Subtitle of host publicationMiscellanea on the Interplay between Randomness and Computation
EditorsOded Goldreich
Chapter13
Pages109-113
Number of pages5
DOIs
StatePublished - 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6650 LNCS

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'From logarithmic advice to single-bit advice'. Together they form a unique fingerprint.

Cite this