A Uniform Min-Max Theorem and Characterizations of Computational Randomness

Jia Zheng · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · 2014

This thesis develops several tools and techniques using ideas from information theory, optimization, and online learning, and applies them to a number of highly related fundamental problems in complexity theory, pseudorandomness theory, and cryptography.

Read the paper · More papers on PaperTik