A Hike in the Phases of the 1-in-3 Satisfiability

Abstract

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.

2 pages, introductory level, proceed. for the Les Houches Session LXXXV 2006 on Complex Systems