24 citations · 87 across the 36 of their papers we have counts for
Showing 2014 · cs.CCShow all
2 papers · 2 filters
cs.CC2014★ 3 cited
Pseudorandomness for concentration bounds and signed majorities
Parikshit Gopalan, Daniel Kane, Raghu Meka
The problem of constructing pseudorandom generators that fool halfspaces has been studied intensively in recent times. For fooling halfspaces over the hypercube with polynomially s…
cs.CC2014★ 3 cited
Inequalities and tail bounds for elementary symmetric polynomial with applications
Parikshit Gopalan, Amir Yehudayoff
We study the extent of independence needed to approximate the product of bounded random variables in expectation, a natural question that has applications in pseudorandomness and m…