2 citations · 3 across the 5 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2024
Boosting uniformity in quasirandom groups: fast and simple
Harm Derksen, Chin Ho Lee, Emanuele Viola
We study the communication complexity of multiplying elements from the group in the number-on-forehead model with parties. We prove a lower bound…
cs.CC2020
Fractional Pseudorandom Generators from Any Fourier Level
Eshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee +2
We prove new results on the polarizing random walk framework introduced in recent works of Chattopadhyay {et al.} [CHHL19,CHLT19] that exploit Fourier tail bounds for classes…
cs.CC2019★ 1 cited
Fourier bounds and pseudorandom generators for product tests
Chin Ho Lee
We study the Fourier spectrum of functions which can be written as a product of Boolean functions on disjoint -bit inputs. We pro…