NP with Small Advice

Lance Fortnow, Adam R. Klivans

Abstract: We prove a new equivalence between the non-uniform and uniform complexity of exponential time. We show that EXP /spl sube/ NP/log if and only if EXP = P/sub /spl par///sup NP/ Our equivalence makes use of a recent result due to Shaltiel and Umans showing EXP in P/sub /spl par///sup NP/ implies EXP in NP/poly.