Name
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. |
Year | Venue | Keywords |
|---|---|---|
2007 | Clinical Orthopaedics and Related Research | satisfiability,statistical mechanics,computational complexity,neural network |
Field | DocType | Volume |
Complex system,Discrete mathematics,Combinatorics,Exponential function,Existential quantification,Satisfiability,Cavity method,Combinatorial optimization,Probabilistic logic,Time complexity,Mathematics | Journal | abs/cond-m |
Citations | PageRank | References |
1 | 0.74 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elitza N. Maneva | 1 | 24 | 4.52 |
| Talya Meltzer | 2 | 415 | 22.18 |
| Jack Raymond | 3 | 1 | 1.08 |
| Andrea Sportiello | 4 | 40 | 7.64 |
| Lenka Zdeborová | 5 | 1190 | 78.62 |