
Explicit SoS lower bounds from highdimensional expanders
We construct an explicit family of 3XOR instances which is hard for O(√(...
read it

CityScale AgentBased Simulators for the Study of NonPharmaceutical Interventions in the Context of the COVID19 Epidemic
We highlight the usefulness of cityscale agentbased simulators in stud...
read it

COVID19 Epidemic Study II: Phased Emergence From the Lockdown in Mumbai
The nationwide lockdown starting 25 March 2020, aimed at suppressing th...
read it

Rigid Matrices From Rectangular PCPs
We introduce a variant of PCPs, that we refer to as rectangular PCPs, wh...
read it

Locally testable codes via highdimensional expanders
Locally testable codes (LTC) are errorcorrecting codes that have a loca...
read it

A note on the explicit constructions of tree codes over polylogarithmicsized alphabet
Recently, Cohen, Haeupler and Schulman gave an explicit construction of ...
read it

A note on the elementary HDX construction of KaufmanOppenheim
In this note, we give a selfcontained and elementary proof of the eleme...
read it

On the Probabilistic Degree of OR over the Reals
We study the probabilistic degree over reals of the OR function on n var...
read it

List Decoding with Double Samplers
We develop the notion of "double samplers", first introduced by Dinur an...
read it

On Multilinear Forms: Bias, Correlation, and Tensor Rank
In this paper, we prove new relations between the bias of multilinear fo...
read it

Boolean functions on highdimensional expanders
We initiate the study of Boolean function analysis on highdimensional e...
read it

Low degree almost Boolean functions are sparse juntas
Nisan and Szegedy showed that low degree Boolean functions are juntas. K...
read it

Agreement tests on graphs and hypergraphs
Agreement tests are a generalization of low degree tests that capture a ...
read it

Complexity of Inference in Graphical Models
It is wellknown that inference in graphical models is hard in the worst...
read it
Prahladh Harsha
is this you? claim profile