On the Regularity of Random 2-SAT and 3-SAT

2025-04-16

AI Summary

This work introduces the novel concept of “degrees of freedom” to quantify the critical number of variables that can be freely assigned while preserving satisfiability in random 2-SAT and 3-SAT instances. Using probabilistic analysis, threshold theory, analytic combinatorics, and random graph theory, we provide the first rigorous definition and asymptotic computation of this metric: for 2-SAT, it is Θ(n/m^{1/2}); for 3-SAT, Θ(n/m^{1/3}), where n denotes the number of variables and m the number of clauses. We derive explicit threshold functions and prove that the 2-SAT degree-of-freedom exhibits continuous differentiability (regularity), whereas the 3-SAT counterpart displays non-regular behavior—revealing its heightened sensitivity to clause-density variations. These results advance the theoretical understanding of SAT phase transitions and the evolution of constraint strength in NP-hard problems.

Technology Category

• Constraint Satisfaction and Optimization: Satisfiability
• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Reasoning under Uncertainty: Other Foundations of Reasoning under Uncertainty

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Security and Privacy: Large-scale security measurements
• Web Mining and Content Analysis: Robustness and generalizability of Web mining methods

Abstract

We consider the random $k$-SAT problem with $n$ variables, $m=m(n)$ clauses, and clause density $alpha=lim_{n oinfty}m/n$ for $k=2,3$. It is known that if $alpha$ is small enough, then the random $k$-SAT problem admits a solution with high probability, which we interpret as the problem being under-constrained. In this paper, we quantify exactly how under-constrained the random $k$-SAT problems are by determining their degrees of freedom, which we define as the threshold for the number of variables we can fix to an arbitrary value before the problem no longer is solvable with high probability. We show that the random $2$-SAT and $3$-SAT problems have $n/m^{1/2}$ and $n/m^{1/3}$ degrees of freedom, respectively. Our main result is an explicit computation of the corresponding threshold functions. Our result shows that the threshold function for the random $2$-SAT problem is regular, while it is non-regular for the random $3$-SAT problem. By regular, we mean continuous and analytic on the interior of its support. This result shows that the random $3$-SAT problem is more sensitive to small changes in the clause density $alpha$ than the random $2$-SAT problem.

Problem

• Quantify degrees of freedom in random 2-SAT and 3-SAT problems
• Determine threshold functions for solvability in random k-SAT
• Compare regularity of threshold functions between 2-SAT and 3-SAT

Innovation

• Quantifies degrees of freedom in k-SAT
• Determines threshold functions for 2-SAT and 3-SAT
• Shows 3-SAT is more sensitive to clause density