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

Elitza Maneva; Talya Meltzer; Jack Raymond; Andrea Sportiello; Lenka Zdeborová

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

Statistical Mechanics 2007-05-23 v1 Disordered Systems and Neural Networks Computational Complexity

Authors: Elitza Maneva , Talya Meltzer , Jack Raymond , Andrea Sportiello , Lenka Zdeborová

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.

Keywords

random satisfiability 1-in-3 SAT SAT/UNSAT transition hard/easy transition heuristic methods

Cite

@article{arxiv.cond-mat/0702421,
  title  = {A Hike in the Phases of the 1-in-3 Satisfiability},
  author = {Elitza Maneva and Talya Meltzer and Jack Raymond and Andrea Sportiello and Lenka Zdeborová},
  journal= {arXiv preprint arXiv:cond-mat/0702421},
  year   = {2007}
}

Comments

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

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

Abstract

Keywords

Cite

Comments

Related papers