Unconditional Lower Bounds against Advice

Harry Buhrman, Lance Fortnow, Rahul Santhanam

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We show several unconditional lower bounds for exponential time classes
against polynomial time classes with advice, including:
\begin{enumerate}
\item For any constant c, \NEXP\P\NP[nc]nc
\item For any constant c, \MAEXP\MAnc
\item \BPEXP\BPPno(1)
\end{enumerate}

It was previously unknown even whether \NEXP\NPn001 .
For the probabilistic classes, no lower bounds for uniform exponential time
against advice were known before.

We also consider the question of whether these lower bounds can be made to work on almost all input lengths rather than on infinitely many. We give an oracle relative to which \NEXP\io\NP, which provides evidence that this
is not possible with current techniques.
Original languageEnglish
Title of host publicationAutomata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I
Pages195-209
Number of pages15
DOIs
Publication statusPublished - 2009

Fingerprint

Dive into the research topics of 'Unconditional Lower Bounds against Advice'. Together they form a unique fingerprint.

Cite this