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.
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
{"_id":"a6SSm4wo3ZWT6SQbr","bibbaseid":"babai-fortnow-nisan-wigderson-bpphassubexponentialtimesimulationsunlessexptimehaspublishableproofs-1993","downloads":0,"creationDate":"2016-02-09T20:13:37.700Z","title":"BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs","author_short":["Babai, L.","Fortnow, L.","Nisan, N.","Wigderson, A."],"year":1993,"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/cc/BabaiFNW93","bibdata":{"title":"BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs","author":["László Babai","Lance Fortnow","Noam Nisan","Avi Wigderson"],"author_short":["Babai, L.","Fortnow, L.","Nisan, N.","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)","bibtex":"@article{ dblp4668838,\n title = {BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs},\n author = {László Babai and Lance Fortnow and Noam Nisan and Avi Wigderson},\n author_short = {Babai, L. and Fortnow, L. and Nisan, N. and Wigderson, A.},\n bibtype = {article},\n type = {article},\n year = {1993},\n key = {dblp4668838},\n id = {dblp4668838},\n biburl = {http://www.dblp.org/rec/bibtex/journals/cc/BabaiFNW93},\n url = {http://dx.doi.org/10.1007/BF01275486},\n journal = {Computational Complexity (CC)},\n pages = {307-318},\n volume = {3},\n text = {Computational Complexity (CC) 3:307-318 (1993)}\n}","bibbaseid":"babai-fortnow-nisan-wigderson-bpphassubexponentialtimesimulationsunlessexptimehaspublishableproofs-1993","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/BF01275486"},"downloads":0},"search_terms":["bpp","subexponential","time","simulations","unless","exptime","publishable","proofs","babai","fortnow","nisan","wigderson"],"keywords":[],"authorIDs":["56ba470d16a1deb95500038d"],"dataSources":["hQ7GmMGETnC7sjjNi"]}