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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
2 pages, introductory level, proceed. for the Les Houches Session LXXXV 2006 on Complex Systems

Keywords

Statistical Mechanics, Disordered Systems and Neural Networks, Computational Complexity

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/124170

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cond-mat/0702421
 http://arxiv.org/abs/cond-mat/0702421

Collections

arXiv