A Hike in the Phases of the 1-in-3 Satisfiability
<|reference_start|>A Hike in the Phases of the 1-in-3 Satisfiability: We summarise our results for the random $\epsilon$--1-in-3 satisfiability problem, where $\epsilon$ is a probability of negation of the variable. We employ both rigorous and heuristic methods to describe the SAT/UNSAT and Hard/Easy transitions.<|reference_end|>
@article{maneva2007a,
    title={A Hike in the Phases of the 1-in-3 Satisfiability},
    author={Elitza Maneva, Talya Meltzer, Jack Raymond, Andrea Sportiello, Lenka
  Zdeborov'a},
    journal={arXiv preprint arXiv:cond-mat/0702421},
    year={2007},
    archivePrefix={arXiv},
    eprint={cond-mat/0702421},
    primaryClass={cond-mat.stat-mech cond-mat.dis-nn cs.CC}
}