The Phase Transition Analysis for Random Regular Exact (s, c, k)-SAT Problem

The length of each clause in a regular (s, c, k)-CNF formula is k . Each argument occurrences s times, among them, positive occurrences (c * s) times and negative occurrences (s-c*s) times, where 0 < c < 1 . A regular exact (s, c, k)-SAT question refers to whether there is a set of...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE access 2021, Vol.9, p.26664-26673
Hauptverfasser:	Mo, Xiaoling, Xu, Daoyun, Wang, Xi
Format:	Artikel
Sprache:	eng
Schlagworte:	Boolean algebra Clustering algorithms First moment method Linear matrix inequalities Method of moments NP-hard problem phase transition Phase transitions Physics Probability satisfiability problem second moment method Transition points
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!