553 citations · 1.3k across the 25 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2009★ 7 cited
Reconstruction and Clustering in Random Constraint Satisfaction Problems
Andrea Montanari, Ricardo Restrepo, Prasad Tetali
Random instances of Constraint Satisfaction Problems (CSP's) appear to be hard for all known algorithms, when the number of constraints per variable lies in a certain interval. Con…
cs.DM2006★ 27 cited
Counting good truth assignments of random k-SAT formulae
Andrea Montanari, Devavrat Shah
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial time (…