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

Simple item page
dc.creatorManeva, Elitza
dc.creatorMeltzer, Talya
dc.creatorRaymond, Jack
dc.creatorSportiello, Andrea
dc.creatorZdeborová, Lenka
dc.date2007-02-18
dc.date.accessioned2026-07-07T07:47:27Z
dc.date.available2026-07-07T07:47:27Z
dc.descriptionWe 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.
dc.description2 pages, introductory level, proceed. for the Les Houches Session LXXXV 2006 on Complex Systems
dc.identifierhttps://arxiv.org/abs/cond-mat/0702421
dc.identifierhttp://arxiv.org/abs/cond-mat/0702421
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/124170
dc.subjectStatistical Mechanics
dc.subjectDisordered Systems and Neural Networks
dc.subjectComputational Complexity
dc.titleA Hike in the Phases of the 1-in-3 Satisfiability
dc.typetext

Files

Collections

arXiv