@inproceedings{ce03d6d316654bd9a07bfa519a304ec8,
title = "De-randomizing BPP: the state of the art",
abstract = "The introduction of randomization into efficient computation is one of the most useful ideas in computer science. Although useful, the extent of the power of randomness over determinism is still being questioned. The most famous concrete version of this question concerns the power of BPP. It is shown that BPP can be nontrivially simulated by deterministic algorithms, if some hard function is available. The state of the art results on this problem are given.",
author = "Avi Wigderson",
year = "1999",
language = "אנגלית",
isbn = "0769500757",
series = "Proceedings of the Annual IEEE Conference on Computational Complexity",
publisher = "IEEE Comp Soc",
pages = "76--77",
booktitle = "Proceedings of the Annual IEEE Conference on Computational Complexity",
note = "Proceedings of the 1999 14th Annual IEEE Conference on Computational Complexity ; Conference date: 04-05-1999 Through 06-05-1999",
}