A Hike in the Phases of the 1-in-3 Satisfiability
classification
❄️ cond-mat.stat-mech
cond-mat.dis-nncs.CC
keywords
epsilonin-3satisfiabilitydescribeeasyemployhardheuristic
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.