Pseudorandomness for Permutation Branching Programs Without the Group Theory

@article{Steinke2012PseudorandomnessFP,
  title={Pseudorandomness for Permutation Branching Programs Without the Group Theory},
  author={Thomas Steinke},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2012},
  volume={19},
  pages={83}
}
  • Thomas Steinke
  • Published 2012 in Electronic Colloquium on Computational Complexity
The typical way we derandomize a randomized computation is to replace the truly random bits used by the computation with suitable pseudorandom bits. We require that using pseudorandom, rather than truly random, bits does not change the output of the computation with probability more than ε; we call this parameter the error. The algorithm that produces the… CONTINUE READING