English
Related papers

Related papers: The SAT Phase Transition

200 papers

We study the typical case properties of the 1-in-3 satisfiability problem, the boolean satisfaction problem where a clause is satisfied by exactly one literal, in an enlarged random ensemble parametrized by average connectivity and…

Statistical Mechanics · Physics 2011-11-09 Jack Raymond , Andrea Sportiello , Lenka Zdeborová

The conception of the conformal phase transiton (CPT), which is relevant for the description of non-perturbative dynamics in gauge theories, is introduced and elaborated. The main features of such a phase transition are established. In…

High Energy Physics - Theory · Physics 2014-11-18 V. A. Miransky , Koichi Yamawaki

Boolean satisfiability [1] (k-SAT) is one of the most studied optimization problems, as an efficient (that is, polynomial-time) solution to k-SAT (for $k\geq 3$) implies efficient solutions to a large number of hard optimization problems…

Computational Complexity · Computer Science 2012-08-03 Maria Ercsey-Ravasz , Zoltan Toroczkai

Phase Transition is associated with a drastic change in some observable (ordered parameter) of the system when the controlled parameter is tuned smoothly. Lee-Yang theory of phase transition is discussed which is related to the accumulation…

Statistical Mechanics · Physics 2022-05-10 Shoaib Akhtar

We review the understanding of the random constraint satisfaction problems, focusing on the q-coloring of large random graphs, that has been achieved using the cavity method of the physicists. We also discuss the properties of the phase…

Computational Complexity · Computer Science 2008-02-04 Florent Krzakala , Lenka Zdeborová

We study $q$-SAT in the multistage model, focusing on the linear-time solvable 2-SAT. Herein, given a sequence of $q$-CNF fomulas and a non-negative integer $d$, the question is whether there is a sequence of satisfying truth assignments…

Computational Complexity · Computer Science 2020-11-05 Till Fluschnik

Interpretation of 3-SAT as a volume filling problem, and its use to explore the SAT/UNSAT phase transition.

Data Structures and Algorithms · Computer Science 2026-04-14 Frederic Gillet

Various light-matter interactions lead to diverse phase diagram structures in superradiant phase transition (SPT) studies. Such systems consist of multiqubit and multimode with anisotropic couplings, one- and two-photon interactions, Stark…

Quantum Physics · Physics 2026-05-13 Wen Zhao , Junlong Tian , Jie Peng

The notion of (auto) catalytic networks has become a cornerstone in understanding the possibility of a sudden dramatic increase of diversity in biological evolution as well as in the evolution of social and economical systems. Here we study…

Other Condensed Matter · Physics 2016-10-05 Rudolf Hanel , Stuart A. Kauffman , Stefan Thurner

In this paper we study biased random K-SAT problems in which each logical variable is negated with probability $p$. This generalization provides us a crossover from easy to hard problems and would help us in a better understanding of the…

Disordered Systems and Neural Networks · Physics 2009-11-10 A. Ramezanpour , S. Moghimi-Araghi

The random k-SAT model is the most important and well-studied distribution over k-SAT instances. It is closely connected to statistical physics; it is used as a testbench for satisfiability algorithms, and average-case hardness over this…

Computational Complexity · Computer Science 2017-03-08 Noah Fleming , Denis Pankratov , Toniann Pitassi , Robert Robere

Random constraint satisfaction problems play an important role in computer science and combinatorics. For example, they provide challenging benchmark instances for algorithms and they have been harnessed in probabilistic constructions of…

Combinatorics · Mathematics 2020-05-27 Amin Coja-Oghlan , Tobias Kapetanopoulos , Noela Müller

Quantum phase transitions encompass a variety of phenomena that occur in quantum systems exhibiting several possible symmetries. Traditionally, these transitions are explored by continuously varying a control parameter that connects two…

Quantum Physics · Physics 2024-06-12 Á. Sáiz , J. Khalouf-Rivera , J. M. Arias , P. Pérez-Fernández , J. Casado-Pascual

Over the last two decades, propositional satisfiability (SAT) has become one of the most successful and widely applied techniques for the solution of NP-complete problems. The aim of this paper is to investigate theoretically how Sat can be…

Logic in Computer Science · Computer Science 2013-05-06 Johannes Klaus Fichte , Stefan Szeider

This paper describes diff-SAT, an Answer Set and SAT solver which combines regular solving with the capability to use probabilistic clauses, facts and rules, and to sample an optimal world-view (multiset of satisfying Boolean variable…

Artificial Intelligence · Computer Science 2021-01-05 Matthias Nickles

In the foreseeable future, toolchains for quantum computing should offer automatic means of transforming a high level problem formulation down to a hardware executable form. Thereby, it is crucial to find (multiple) transformation paths…

Quantum Physics · Physics 2025-10-13 Lukas Schmidbauer , Wolfgang Mauerer

Two-level atoms interacting with a one mode cavity field at zero temperature have order parameters which reflect the presence of a quantum phase transition at a critical value of the atom-cavity coupling strength. Two popular examples are…

Quantum Physics · Physics 2015-06-11 J. G. Hirsch , O. Castaños , E. Nahmad-Achar , R. López-Penã

We consider the K-satisfiability problem on a regular d-ary rooted tree. For this model, we demonstrate how we can calculate in closed form, the moments of the total number of solutions as a function of d and K, where the average is over…

Statistical Mechanics · Physics 2015-05-30 Supriya Krishnamurthy , Sumedha

The most important recent results in the theory of phase transitions and quantum effects in quantum anharmonic crystals are presented and discussed. In particular, necessary and sufficient conditions for a phase transition to occur at some…

Statistical Mechanics · Physics 2015-06-04 Sergio Albeverio , Yuri Kozitsky , Yuri Kondratiev , Michael Roeckner

We consider the random regular $k$-NAE-SAT problem with $n$ variables each appearing in exactly $d$ clauses. For all $k$ exceeding an absolute constant $k_0$, we establish explicitly the satisfiability threshold $d_*=d_*(k)$. We prove that…

Probability · Mathematics 2013-10-18 Jian Ding , Allan Sly , Nike Sun
‹ Prev 1 3 4 5 6 7 10 Next ›