Towards NEXP versus BPP?
Abstract. We outline two plausible approaches to improving the miserable state of affairs regarding lower bounds against probabilistic polynomial time (namely, the class BPP).
Sorry, we are unable to provide the full text but you may find it at the following location(s):
http://citeseerx.ist.psu.edu/v... (external link)
http://www.stanford.edu/~rrwil... (external link)