BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs. Babai, L., Fortnow, L., Nisan, N., & Wigderson, A. Computational Complexity (CC), 3:307-318, 1993.
BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs [link]Paper  bibtex   
@article{ dblp4668838,
  title = {BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs},
  author = {László Babai and Lance Fortnow and Noam Nisan and Avi Wigderson},
  author_short = {Babai, L. and Fortnow, L. and Nisan, N. and Wigderson, A.},
  bibtype = {article},
  type = {article},
  year = {1993},
  key = {dblp4668838},
  id = {dblp4668838},
  biburl = {http://www.dblp.org/rec/bibtex/journals/cc/BabaiFNW93},
  url = {http://dx.doi.org/10.1007/BF01275486},
  journal = {Computational Complexity (CC)},
  pages = {307-318},
  volume = {3},
  text = {Computational Complexity (CC) 3:307-318 (1993)}
}

Downloads: 0