Related papers: The SAT Phase Transition
Random constraint satisfaction problems (CSP) have been studied extensively using statistical physics techniques. They provide a benchmark to study average case scenarios instead of the worst case one. The interplay between statistical…
We have made a variational analysis on an evolution of superconductivity from weak to strong coupling regime. In contrast to a crossover without thermodynamic anomaly found in a dilute system, we show the existence of a quantum phase…
Satisfiability checking for Linear Temporal Logic (LTL) is a fundamental step in checking for possible errors in LTL assertions. Extant LTL satisfiability checkers use a variety of different search procedures. With the sole exception of LTL…
The aim of this short note is mainly pedagogical. It summarizes some knowledge about Boolean satisfiability (SAT) and the P=NP? problem in an elementary mathematical language. A convenient scheme to visualize and manipulate CNF formulae is…
We study a random matrix model for the statistical properties of the purity of a bipartite quantum system at a finite (fictitious) temperature. This enables us to write the generating function for the cumulants, for both balanced and…
We consider the random $k$-SAT problem with $n$ variables, $m=m(n)$ clauses, and clause density $\alpha=\lim_{n\to\infty}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…
In the coevolving voter model, each voter has one of two diametrically opposite opinions, and a voter encountering a neighbor with the opposite opinion may either adopt it or rewire the connection to another randomly chosen voter sharing…
In this paper phase of a signal has been viewed from a different angle. According to this view a signal can have countably infinitely many phases, one associated with each Fourier component. In other words each frequency has a phase…
The second moment method has always been an effective tool to lower bound the satisfiability threshold of many random constraint satisfaction problems. However, the calculation is usually hard to carry out and as a result, only some loose…
A simplified Ginzburg-Landau theory is presented to study generally a coupling of a first-order phase transition (FOPT) to a second-order phase transition (SOPT). We show analytically that, due to the coupling between the two phase…
We consider Achlioptas processes for k-SAT formulas. We create a semi-random formula with n variables and m clauses, where each clause is a choice, made on-line, between two or more uniformly random clauses. Our goal is to delay the…
One-dimensional model of a system where first-order phase transition occurs is examined in the present paper. It is shown that basic properties of the phenomenon, such as a well defined temperature of transition, are caused both by…
The problem of P vs. NP is very serious, and solutions to the problem can help save lives. This article is an attempt at solving the problem using a computer algorithm. It is presented in a fashion that will hopefully allow for easy…
We present a new structural (or syntatic) approach for estimating the satisfiability threshold of random 3-SAT formulae. We show its efficiency in obtaining a jump from the previous upper bounds, lowering them to 4.506. The method combines…
The robustness and correctness of SAT solvers are receiving more and more attention. In recent SAT competitions, a proof of unsatisfiability emitted by SAT solvers must be checked. So far, no proof checker has been efficient for every case.…
We consider the setting in which a strong binary instrument is available for a binary treatment. The traditional LATE approach assumes the monotonicity condition stating that there are no defiers (or compliers). Since this condition is not…
The problem of identifying the satisfiability threshold of random $3$-SAT formulas has received a lot of attention during the last decades and has inspired the study of other threshold phenomena in random combinatorial structures. The…
In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard. Although a solution to a NP-complete can be verified quickly, there is no known algorithm to solve it in polynomial time. There exists…
Random $K$-satisfiability ($K$-SAT) is a paradigmatic model system for studying phase transitions in constraint satisfaction problems and for developing empirical algorithms. The statistical properties of the random $K$-SAT solution space…
Given a 2-SAT formula $F$ consisting of $n$ variables and $\cn$ random clauses, what is the largest number of clauses $\max F$ satisfiable by a single assignment of the variables? We bound the answer away from the trivial bounds of…