8 citations · 9 across the 9 of their papers we have counts for
Showing 2007Show all
3 papers · 1 filter
cs.CC2007
On the Satisfiability Threshold and Clustering of Solutions of Random 3-SAT Formulas
Elitza Maneva, Alistair Sinclair
We study the structure of satisfying assignments of a random 3-SAT formula. In particular, we show that a random formula of density 4.453 or higher almost surely has no non-trivial…
math.CO2007
Pruning Processes and a New Characterization of Convex Geometries
Federico Ardila, Elitza Maneva
We provide a new characterization of convex geometries via a multivariate version of an identity that was originally proved by Maneva, Mossel and Wainwright for certain combinatori…
cond-mat.stat-mech2007
A Hike in the Phases of the 1-in-3 Satisfiability
Elitza Maneva, Talya Meltzer, Jack Raymond +2
We summarise our results for the random --1-in-3 satisfiability problem, where is a probability of negation of the variable. We employ both rigorous and heuristic methods to…