License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-6151
URL: http://drops.dagstuhl.de/opus/volltexte/2006/615/

van Melkebeek, Dieter ; Pervyshev, Konstantin

A Generic Time Hierarchy for Semantic Models With One Bit of Advice

pdf-format:
Dokument 1.pdf (403 KB)


Abstract

We show that for any reasonable semantic model of computation and for any positive integer $a$ and rationals $1 leq c < d$, there exists a language computable in time $n^d$ with $a$ bits of advice but not in time $n^c$ with $a$ bits of advice. A semantic model is one for which there exists a computable enumeration that contains all machines in the model but may also contain others. We call such a model reasonable if it has an efficient universal machine that can be complemented within the model in exponential time and if it is efficiently closed under deterministic transducers. Our result implies the first such hierarchy theorem for randomized machines with zero-sided error, quantum machines with one- or zero-sided error, unambiguous machines, symmetric alternation, Arthur-Merlin games of any signature, interactive proof protocols with one or multiple provers, etc.

BibTeX - Entry

@InProceedings{vanmelkebeek_et_al:DSP:2006:615,
  author =	{Dieter van Melkebeek and Konstantin Pervyshev},
  title =	{A Generic Time Hierarchy for Semantic Models With One Bit of Advice},
  booktitle =	{Complexity of Boolean Functions},
  year =	{2006},
  editor =	{Matthias Krause and Pavel Pudl{\'a}k and R{\"u}diger Reischuk and Dieter van Melkebeek},
  number =	{06111},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/615},
  annote =	{Keywords: Time hierarchy, non-uniformity, one bit of advice, probabilistic algorithms}
}

Keywords: Time hierarchy, non-uniformity, one bit of advice, probabilistic algorithms
Seminar: 06111 - Complexity of Boolean Functions
Issue date: 2006
Date of publication: 20.11.2006


DROPS-Home | Fulltext Search | Imprint Published by LZI