We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including: 1. For any constant c, NEXP 6⊆ P c]/nc 2. For any constant c, MAEXP 6⊆ MA/nc 3. BPEXP 6⊆ BPP/n It was previously unknown even whether NEXP ⊆ NP/n. For the probabilistic classes, no lower bounds for uniform exponential time against advice were known before. We also cons...
