A Hike in the Phases of the 1-in-3 Satisfiability
Elitza Maneva, Talya Meltzer, Jack Raymond, Andrea Sportiello, Lenka Zdeborová · arXiv (Cornell University) · 2007
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 describe the SAT/UNSAT and Hard/Easy transitions.