Related papers: The K-sat problem in a simple limit
We derive a set of relations among the thermal components of the 3-point function and its spectral representations at finite temperature in the real-time formalism. We then use these to explicitly calculate the 3-point spectral densities…
The description of spontaneous symmetry breaking that underlies the connection between classically ordered objects in the thermodynamic limit and their individual quantum mechanical building blocks is one of the cornerstones of modern…
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…
(k,s)-SAT is the satisfiability problem restricted to instances where each clause has exactly k literals and every variable occurs at most s times. It is known that there exists a function f such that for s\leq f(k) all (k,s)-SAT instances…
The quantum-mechanical and thermodynamic properties of a 3-level molecular cooling cycle are derived. An inadequacy of earlier models is rectified in accounting for the spontaneous emission and absorption associated with the coupling to the…
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…
This paper presents an algorithm for 3-SAT problems. First, logical formulas are transformed into elementary algebraic formulas. Second, complex trigonometric functions are assigned to the variables in the elementary algebraic formulas, and…
An integrable quantum spin ladder based on the SU(4) symmetry algebra with boundary defects is studied in the framework of boundary integrability. Five nontrivial solutions of the reflection equations lead to different boundary impurities.…
We study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to equalities of attribute values in successive positions and to repetitions of attribute values in the future or…
We study hierarchies of replica-symmetry-breaking solutions of the Sherrington-Kirkpatrick model. Stationarity equations for order parameters of solutions with an arbitrary number of hierarchies are set and the limit to infinite number of…
We determine under which conditions certain natural models of random constraint satisfaction problems have sharp thresholds of satisfiability. These models include graph and hypergraph homomorphism, the $(d,k,t)$-model, and binary…
Form a random k-SAT formula on n variables by selecting uniformly and independently m=rn clauses out of all 2^k (n choose k) possible k-clauses. The Satisfiability Threshold Conjecture asserts that for each k there exists a constant r_k…
The fixed template Promise Constraint Satisfaction Problem (PCSP) is a recently proposed significant generalization of the fixed template CSP, which includes approximation variants of satisfiability and graph coloring problems. All the…
We analyse the complexity of the satisfiability problem ssmSAT for State Space Models (SSM), which asks whether an input sequence can lead the model to an accepting configuration. We find that ssmSAT is undecidable in general, reflecting…
A wide class of problems in combinatorics, computer science and physics can be described along the following lines. There are a large number of variables ranging over a finite domain that interact through constraints that each bind a few…
Recently, Ai, Bender and Sarkar gave a prescription on how to obtain $\mathcal{PT}$-symmetric field theory results from an analytic continuation of Hermitian field theories. I perform this analytic continuation for the massless (critical)…
I describe one quantum approach to solving 3-satisfiability (3-SAT), the well known problem in computer science. The approach is based on repeatedly measuring the truth value of the clauses forming the 3-SAT proposition using a…
The Promise Constraint Satisfaction Problem (PCSP) is a generalization of the Constraint Satisfaction Problem (CSP) that includes approximation variants of satisfiability and graph coloring problems. Barto [LICS '19] has shown that a…
We consider a system of three particles, either three identical bosons or two identical fermions plus an impurity, within a three-dimensional isotropic trap interacting via a contact interaction. Using two approaches, one using an infinite…
For static reductions of isotropic and anisotropic Magnetohydrodynamics plasma equilibrium models, a complete classification of admitted point symmetries and conservation laws up to first order is presented. It is shown that the symmetry…