A zero-one SUBEXP-dimension law for BPP
Computational Complexity
2015-03-18 v1
Abstract
We show that BPP has either SUBEXP-dimension zero (randomness is easy) or BPP=EXP (randomness is intractable).
Cite
@article{arxiv.1101.4848,
title = {A zero-one SUBEXP-dimension law for BPP},
author = {Philippe Moser},
journal= {arXiv preprint arXiv:1101.4848},
year = {2015}
}
Comments
to be published in information processing letters