-
Decoding Multivariate Multiplicity Codes on Product Sets
The multiplicity Schwartz-Zippel lemma bounds the total multiplicity of ...
12/02/2020 ∙ by Siddharth Bhandari, et al. ∙
0
∙
share
read it
-
Explicit SoS lower bounds from high-dimensional expanders
We construct an explicit family of 3XOR instances which is hard for O(√(...
09/11/2020 ∙ by Irit Dinur, et al. ∙
0
∙
share
read it
-
City-Scale Agent-Based Simulators for the Study of Non-Pharmaceutical Interventions in the Context of the COVID-19 Epidemic
We highlight the usefulness of city-scale agent-based simulators in stud...
08/11/2020 ∙ by Shubhada Agrawal, et al. ∙
0
∙
share
read it
-
COVID-19 Epidemic Study II: Phased Emergence From the Lockdown in Mumbai
The nation-wide lockdown starting 25 March 2020, aimed at suppressing th...
06/05/2020 ∙ by Prahladh Harsha, et al. ∙
0
∙
share
read it
-
Rigid Matrices From Rectangular PCPs
We introduce a variant of PCPs, that we refer to as rectangular PCPs, wh...
05/06/2020 ∙ by Amey Bhangale, et al. ∙
0
∙
share
read it
-
Locally testable codes via high-dimensional expanders
Locally testable codes (LTC) are error-correcting codes that have a loca...
05/03/2020 ∙ by Yotam Dikstein, et al. ∙
0
∙
share
read it
-
A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet
Recently, Cohen, Haeupler and Schulman gave an explicit construction of ...
02/19/2020 ∙ by Siddharth Bhandari, et al. ∙
0
∙
share
read it
-
A note on the elementary HDX construction of Kaufman-Oppenheim
In this note, we give a self-contained and elementary proof of the eleme...
12/24/2019 ∙ by Prahladh Harsha, et al. ∙
0
∙
share
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...
12/05/2018 ∙ by Siddharth Bhandari, et al. ∙
0
∙
share
read it
-
List Decoding with Double Samplers
We develop the notion of "double samplers", first introduced by Dinur an...
08/01/2018 ∙ by Irit Dinur, et al. ∙
0
∙
share
read it
-
On Multilinear Forms: Bias, Correlation, and Tensor Rank
In this paper, we prove new relations between the bias of multilinear fo...
04/24/2018 ∙ by Abhishek Bhrushundi, et al. ∙
0
∙
share
read it
-
Boolean functions on high-dimensional expanders
We initiate the study of Boolean function analysis on high-dimensional e...
04/22/2018 ∙ by Irit Dinur, et al. ∙
0
∙
share
read it
-
Low degree almost Boolean functions are sparse juntas
Nisan and Szegedy showed that low degree Boolean functions are juntas. K...
11/26/2017 ∙ by Irit Dinur, et al. ∙
0
∙
share
read it
-
Agreement tests on graphs and hypergraphs
Agreement tests are a generalization of low degree tests that capture a ...
11/26/2017 ∙ by Irit Dinur, et al. ∙
0
∙
share
read it
-
Complexity of Inference in Graphical Models
It is well-known that inference in graphical models is hard in the worst...
06/13/2012 ∙ by Venkat Chandrasekaran, et al. ∙
0
∙
share
read it
