4 papers · 1 filter
On Extremal Properties of k-CNF: Capturing Threshold Functions
Mohit Gurumukhani, Marvin Künnemann, Ramamohan Paturi
We consider a basic question on the expressiveness of -CNF formulas: How well can -CNF formulas capture threshold functions? Specifically, what is the largest number of assig…
Condensing and Extracting Against Online Adversaries
Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach +1
We study the tasks of deterministically condensing and extracting from Online Non-Oblivious Symbol Fixing (oNOSF) sources, a natural model of defective randomness where extraction…
Two-Sided Lossless Expanders in the Unbalanced Setting
Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach +1
We present the first explicit construction of two-sided lossless expanders in the unbalanced setting (bipartite graphs that have polynomially many more nodes on the left than on th…
Local Enumeration and Majority Lower Bounds
Mohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák +2
Depth-3 circuit lower bounds and -SAT algorithms are intimately related; the state-of-the-art -circuit lower bound and the -SAT algorithm are based on the same combina…