A Note on Unconditional Subexponential-time Pseudo-deterministic Algorithms for BPP Search Problems
Computational Complexity
2017-07-20 v1
Abstract
We show the first unconditional pseudo-determinism result for all of search-BPP. Specifically, we show that every BPP search problem can be computed pseudo-deterministically on average for infinitely many input lengths. In other words, for infinitely many input lengths and for any polynomial-time samplable distribution our algorithm succeeds in producing a unique answer (if one exists) with high probability over the distribution and the coins tossed.
Cite
@article{arxiv.1707.05808,
title = {A Note on Unconditional Subexponential-time Pseudo-deterministic Algorithms for BPP Search Problems},
author = {Dhiraj Holden},
journal= {arXiv preprint arXiv:1707.05808},
year = {2017}
}