
arXiv: cs/0005024
Phase transition is an important feature of SAT problem. For random k-SAT model, it is proved that as r (ratio of clauses to variables) increases, the structure of solutions will undergo a sudden change like satisfiability phase transition when r reaches a threshold point. This phenomenon shows that the satisfying truth assignments suddenly shift from being relatively different from each other to being very similar to each other.
13 pages, 3 figures
FOS: Computer and information sciences, Computer Science - Artificial Intelligence, Analysis of algorithms and problem complexity, I.2.8, Computational Complexity (cs.CC), Computer Science - Computational Complexity, Artificial Intelligence (cs.AI), phase transition, SAT problem, F.2.m; I.2.8, F.2.m
FOS: Computer and information sciences, Computer Science - Artificial Intelligence, Analysis of algorithms and problem complexity, I.2.8, Computational Complexity (cs.CC), Computer Science - Computational Complexity, Artificial Intelligence (cs.AI), phase transition, SAT problem, F.2.m; I.2.8, F.2.m
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 7 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
