Entropy Flattening
Speaker: JuspreetTitle: Entropy Flattening
Date: 16 Mar 2020 6:00pm-7:00pm
Location: Zoom
Food: Self-prepared
Zoom link: https://harvard.zoom.us/j/322381213
Abstract: We introduce and discuss the problem of Entropy Flatenning for n-bit random variables. We will talk about the recent developments of a lower bound on query complexity (in the black-box model) by CGVZ’17. We will also discuss the difficulties in obtaining a lower bound on the seed-length (randomness) to the flattening algorithm. Time permitting, we discuss relationships with the SDU-k pproblem in detail.