Search Results for author:
Found 5 papers, 1 papers with code
Errors are Robustly Tamed in Cumulative Knowledge Processes
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.
Approximability of all Boolean CSPs with linear sketches
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
Point-hyperplane incidence geometry and the log-rank conjecture
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
The Optimality of Correlated Sampling
In this note, we give a surprisingly simple proof that this protocol is in fact tight.
Computational Complexity Information Theory Information Theory
Performance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem
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$.
