104,279 research outputs found
What makes a phase transition? Analysis of the random satisfiability problem
In the last 30 years it was found that many combinatorial systems undergo
phase transitions. One of the most important examples of these can be found
among the random k-satisfiability problems (often referred to as k-SAT), asking
whether there exists an assignment of Boolean values satisfying a Boolean
formula composed of clauses with k random variables each. The random 3-SAT
problem is reported to show various phase transitions at different critical
values of the ratio of the number of clauses to the number of variables. The
most famous of these occurs when the probability of finding a satisfiable
instance suddenly drops from 1 to 0. This transition is associated with a rise
in the hardness of the problem, but until now the correlation between any of
the proposed phase transitions and the hardness is not totally clear. In this
paper we will first show numerically that the number of solutions universally
follows a lognormal distribution, thereby explaining the puzzling question of
why the number of solutions is still exponential at the critical point.
Moreover we provide evidence that the hardness of the closely related problem
of counting the total number of solutions does not show any phase
transition-like behavior. This raises the question of whether the probability
of finding a satisfiable instance is really an order parameter of a phase
transition or whether it is more likely to just show a simple sharp threshold
phenomenon. More generally, this paper aims at starting a discussion where a
simple sharp threshold phenomenon turns into a genuine phase transition
Quiet Planting in the Locked Constraint Satisfaction Problems
We study the planted ensemble of locked constraint satisfaction problems. We
describe the connection between the random and planted ensembles. The use of
the cavity method is combined with arguments from reconstruction on trees and
first and second moment considerations; in particular the connection with the
reconstruction on trees appears to be crucial. Our main result is the location
of the hard region in the planted ensemble. In a part of that hard region
instances have with high probability a single satisfying assignment.Comment: 21 pages, revised versio
Scaling of running time of quantum adiabatic algorithm for propositional satisfiability
We numerically study quantum adiabatic algorithm for the propositional
satisfiability. A new class of previously unknown hard instances is identified
among random problems. We numerically find that the running time for such
instances grows exponentially with their size. Worst case complexity of quantum
adiabatic algorithm therefore seems to be exponential.Comment: 7 page
A nonmonotone GRASP
A greedy randomized adaptive search procedure (GRASP) is an itera-
tive multistart metaheuristic for difficult combinatorial optimization problems. Each
GRASP iteration consists of two phases: a construction phase, in which a feasible
solution is produced, and a local search phase, in which a local optimum in the
neighborhood of the constructed solution is sought. Repeated applications of the con-
struction procedure yields different starting solutions for the local search and the
best overall solution is kept as the result. The GRASP local search applies iterative
improvement until a locally optimal solution is found. During this phase, starting from
the current solution an improving neighbor solution is accepted and considered as the
new current solution. In this paper, we propose a variant of the GRASP framework that
uses a new “nonmonotone” strategy to explore the neighborhood of the current solu-
tion. We formally state the convergence of the nonmonotone local search to a locally
optimal solution and illustrate the effectiveness of the resulting Nonmonotone GRASP
on three classical hard combinatorial optimization problems: the maximum cut prob-
lem (MAX-CUT), the weighted maximum satisfiability problem (MAX-SAT), and
the quadratic assignment problem (QAP)
Exhaustive enumeration unveils clustering and freezing in random 3-SAT
We study geometrical properties of the complete set of solutions of the
random 3-satisfiability problem. We show that even for moderate system sizes
the number of clusters corresponds surprisingly well with the theoretic
asymptotic prediction. We locate the freezing transition in the space of
solutions which has been conjectured to be relevant in explaining the onset of
computational hardness in random constraint satisfaction problems.Comment: 4 pages, 3 figure
- …