no code implementations • 11 Sep 2023 • Anna Brandenberger, Cassandra Marcussen, Elchanan Mossel, Madhu Sudan
We study processes of societal knowledge accumulation, where the validity of a new unit of knowledge depends both on the correctness of its derivation and on the validity of the units it depends on.
no code implementations • 24 Feb 2021 • Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy
In this work we consider the approximability of $\textsf{Max-CSP}(f)$ in the context of sketching algorithms and completely characterize the approximability of all Boolean CSPs.
Computational Complexity Data Structures and Algorithms
no code implementations • 23 Jan 2021 • Noah Singer, Madhu Sudan
Finally, we discuss various constructions (due to others) which yield configurations with incidence density $\Omega(1)$ and bipartite subgraph density $2^{-\Omega(\sqrt d)}$.
Combinatorics Computational Complexity
1 code implementation • 4 Dec 2016 • Mohammad Bavarian, Badih Ghazi, Elad Haramaty, Pritish Kamath, Ronald L. Rivest, Madhu Sudan
In this note, we give a surprisingly simple proof that this protocol is in fact tight.
Computational Complexity Information Theory Information Theory
no code implementations • 1 Feb 2014 • David Gamarnik, Madhu Sudan
We show that the Survey Propagation-guided decimation algorithm fails to find satisfying assignments on random instances of the "Not-All-Equal-$K$-SAT" problem if the number of message passing iterations is bounded by a constant independent of the size of the instance and the clause-to-variable ratio is above $(1+o_K(1)){2^{K-1}\over K}\log^2 K$ for sufficiently large $K$.