Skip to main content
Article thumbnail
Location of Repository

Towards NEXP versus BPP?

By Ryan Williams

Abstract

Abstract. We outline two plausible approaches to improving the miserable state of affairs regarding lower bounds against probabilistic polynomial time (namely, the class BPP).

Year: 2014
OAI identifier: oai:CiteSeerX.psu:10.1.1.413.2008
Provided by: CiteSeerX
Download PDF:
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)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.