eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2010-01-19
1
11
10.4230/DagSemProc.09421.8
article
Unconditional Lower Bounds against Advice
Buhrman, Harry
Fortnow, Lance
Santhanam, Rahul
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including: (1) For any constant c, NEXP not in P^{NP[n^c]} (2) For any constant c, MAEXP not in MA/n^c (3) BPEXP not in BPP/n^{o(1)}.
It was previously unknown even whether NEXP in 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 in i.o.NP, which provides evidence that this is not possible with current techniques.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol09421/DagSemProc.09421.8/DagSemProc.09421.8.pdf
Advice
derandomization
diagonalization
lower bounds
semantic classes