A tight lower bound for entropy flattening
Conference Paper
Version History: Preliminary version posted as ECCC TR18-119.
We study entropy flattening: Given a circuit \(C_X\) implicitly describing an n-bit source \(X\) (namely, \(X\) is the output of \(C_X \) on a uniform random input), construct another circuit...