Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR09-064 | 3rd August 2009 20:52

Unconditional Lower Bounds against Advice

RSS-Feed




TR09-064
Authors: Harry Buhrman, Lance Fortnow, Rahul Santhanam
Publication: 5th August 2009 20:37
Downloads: 2059
Keywords: 


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 \not \subseteq \P^{\NP[n^c]}/n^c$
\item For any constant $c$, $\MAEXP \not \subseteq \MA/n^c$
\item $\BPEXP \not \subseteq \BPP/n^{o(1)}$
\end{enumerate}

It was previously unknown even whether $\NEXP \subseteq \NP/n^{0.01}$.
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 \subseteq \io\NP$, which provides evidence that this
is not possible with current techniques.



ISSN 1433-8092 | Imprint