Treffer: The phase transition in random regular exact (3 s  + s , k)-SAT problem.

A CNF formula with each clause of length k and each variable occurring 4 s times, where positive occurrences are 3 s and negative occurrences are s, is a regular (3 s + s, k)-CNF formula (F 3 s + s, k formula). The random regular exact (3 s + s, k)-SAT problem is whether there exists a set of Boolean variable assignments such that exactly one literal is true for each clause in the F 3 s + s, k formula. By introducing a random instance generation model, the satisfiability phase transition of the solution is analyzed by using the first moment method, the second moment method, and the small subgraph conditioning method, which gives the phase transition point s* of the random regular exact (3 s + s, k)-SAT problem for k ≥3. When s < s*, F 3 s + s, k formula is satisfiable with high probability; when s > s*, F 3 s + s, k formula is unsatisfiable with high probability. Finally, through the experimental verification, the results show that the theoretical proofs are consistent with the experimental results. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Intelligent & Fuzzy Systems is the property of Sage Publications Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Volltext ist im Gastzugang nicht verfügbar. Melden Sie sich für Vollzugriff an.