Related papers: The K-sat problem in a simple limit
We examine counterparts of the Reissner-Nordstrom-anti-de Sitter black hole spacetimes in which the two-sphere has been replaced by a surface Sigma of constant negative or zero curvature. When horizons exist, the spacetimes are black holes…
The divergence of the thermal conductivity in the thermodynamic limit is thoroughly investigated. The divergence law is consistently determined with two different numerical approaches based on equilibrium and non-equilibrium simulations. A…
We present a topological barrier to efficient computation, revealed by comparing the geometry of 2 SAT and 3 SAT solution spaces. Viewing the set of satisfying assignments as a cubical complex within the Boolean hypercube, we prove that…
We study the energy landscape of the Traveling Salesperson problem (TSP) using exact ground states and a novel linear programming approach to generate excited states with closely defined properties. We look at four different ensembles,…
We study in detail the quantum Sherrington-Kirkpatrick (SK) model, i.e. the infinite-range Ising spin glass in a transverse field, by solving numerically the effective one-dimensional model that the quantum SK model can be mapped to in the…
We study in detail the analytic properties of the Thermodynamic Bethe Ansatz (TBA) equations for the anomalous dimensions of composite operators in the planar limit of the 3D N=6 superconformal Chern-Simons gauge theory and derive…
Constraint satisfaction problems (CSPs) models many important intractable NP-hard problems such as propositional satisfiability problem (SAT). Algorithms with non-trivial upper bounds on running time for restricted SAT with bounded clause…
We study the localization in the one-dimensional trap model in terms of statistical mechanics of trajectories. By numerically investigating overlap between trajectories of two particles on a common disordered potential, we find that there…
The realizability problem is a well-known problem in the analysis of complex systems, which can be modeled as an infinite-dimensional moment problem. More precisely, as a truncated $K-$moment problem where $K$ is the space of all possible…
Here we study the NP-complete $K$-SAT problem. Although the worst-case complexity of NP-complete problems is conjectured to be exponential, there exist parametrized random ensembles of problems where solutions can typically be found in…
The thermodynamic interpretation of the Stephani Universes is studied in detail. The general expression of the speed of sound and of the thermodynamic schemes associated with a thermodynamic solution is obtained. The constraints imposed on…
This article investigates the properties of a few interacting particles trapped in a few wells and how these properties change under adiabatic tuning of interaction strength and inter-well tunneling. While some system properties are…
This article is the first in a series dealing with the thermodynamic properties of quantum Coulomb systems. In this first part, we consider a general real-valued function $E$ defined on all bounded open sets of $\R^3$. Our aim is to give…
Inspired by recent results in the context of AdS/CFT integrability, we reconsider the Thermodynamic Bethe Ansatz equations describing the 1D fermionic Hubbard model at finite temperature. We prove that the infinite set of TBA equations are…
The utility of satisfiability (SAT) as an application focused hard computational problem is well established. We explore the potential of quantum annealing to enhance classical SAT solving, especially where sampling from the space of all…
Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues that recent parameterized complexity results provide insight into…
In the Planar 3-SAT problem, we are given a 3-SAT formula together with its incidence graph, which is planar, and are asked whether this formula is satisfiable. Since Lichtenstein's proof that this problem is NP-complete, it has been used…
Many NP-complete constraint satisfaction problems appear to undergo a "phase transition'' from solubility to insolubility when the constraint density passes through a critical threshold. In all such cases it is easy to derive upper bounds…
The satisfiability threshold for constraint satisfaction problems is that value of the ratio of constraints (or clauses) to variables, above which the probability that a random instance of the problem has a solution is zero in the large…
We quantize a scalar field at finite temperature T in the background of a classical black hole, adopting 't Hooft's ``brick wall'' model with generic mixed boundary conditions at the brick wall boundary. We first focus on the exactly…