HIGHLIGHTS
- who: Rohit Agrawal from the (UNIVERSITY) have published the research: Coin Theorems and the Fourier Expansion, in the Journal: (JOURNAL)
- what: In this note the authors compare two measures of the complexity of a class F of Boolean functions studied in_(unconditional) pseudorandomness: F's ability to distinguish between biased and uniform coins (the coin problem) and the norms of the different levels of the Fourier expansion of functions in F (the Fourier growth). The authors show that for coins with low bias ε = o(1/n) a function's distinguishing advantage in the coin problem . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.