Pseudorandomness for Permutation and Regular Branching Programs

Anindya De. Pseudorandomness for Permutation and Regular Branching Programs. In Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, June 8-10, 2011. pages 221-231, IEEE Computer Society, 2011. [doi]

@inproceedings{De11,
  title = {Pseudorandomness for Permutation and Regular Branching Programs},
  author = {Anindya De},
  year = {2011},
  doi = {10.1109/CCC.2011.23},
  url = {http://dx.doi.org/10.1109/CCC.2011.23},
  researchr = {https://researchr.org/publication/De11},
  cites = {0},
  citedby = {0},
  pages = {221-231},
  booktitle = {Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, June 8-10, 2011},
  publisher = {IEEE Computer Society},
}