Pseudorandomness for Regular Branching Programs via Fourier Analysis
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 655-670
Abstract
No abstract availableKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3Lecture Notes in Computer Science, 2012
- Undirected connectivity in log-spaceJournal of the ACM, 2008
- Stable distributions, pseudorandom generators, embeddings, and data stream computationJournal of the ACM, 2006
- On the Power of the Randomized Iterate2006
- Using Nondeterminism to Amplify HardnessSIAM Journal on Computing, 2006
- Derandomized Squaring of Graphs2005
- Derandomized Constructions of k-Wise (Almost) Independent PermutationsLecture Notes in Computer Science, 2005
- Improved Pseudorandom Generators for Combinatorial RectanglesCombinatorica, 2002
- Efficient construction of a small hitting set for combinatorial rectangles in high dimensionCombinatorica, 1997
- Small-Bias Probability Spaces: Efficient Constructions and ApplicationsSIAM Journal on Computing, 1993