Related papers: Bose-Einstein Condensation in Satisfiability Probl…
The random 3-satisfiability (3-SAT) problem is in the unsatisfiable (UNSAT) phase when the clause density $\alpha$ exceeds a critical value $\alpha_s \approx 4.267$. However, rigorously proving the unsatisfiability of a given large 3-SAT…
Consider N equally-spaced points on a circle of circumference N. Choose at random n points out of $N$ on this circle and append clockwise an arc of integral length k to each such point. The resulting random set is made of a random number of…
We determine the exact threshold of satisfiability for random instances of a particular NP-complete constraint satisfaction problem (CSP). This is the first random CSP model for which we have determined a precise linear satisfiability…
The focusing of a propagating untrapped Bose-Einstein condensate is studied theoretically. We use a scaling solution method comprising a time-dependent scaling function to analytically examine the dynamics of a falling Bose-Einstein…
We calculate certain features of Bose-Einstein condensation in the ideal gas by using recurrence relations for the partition function. The grand canonical ensemble gives inaccurate results for certain properties of the condensate that are…
An instance of a random constraint satisfaction problem defines a random subset S (the set of solutions) of a large product space (the set of assignments). We consider two prototypical problem ensembles (random k-satisfiability and…
Random $k$-SAT is the single most intensely studied example of a random constraint satisfaction problem. But despite substantial progress over the past decade, the threshold for the existence of satisfying assignments is not known precisely…
We consider Bose-Einstein condensation of noninteracting homogeneous three-dimensional gas in canonical ensemble when both particle number $N$ and total momentum $\mathbf{P}$ of all particles are fixed. Using the saddle point method, we…
Generating diverse solutions to the Boolean Satisfiability Problem (SAT) is a hard computational problem with practical applications for testing and functional verification of software and hardware designs. We explore the way to generate…
Quantum sensors based on matter-wave interferometry are promising candidates for high-precision gravimetry and inertial sensing in space. The favorable source for the coherent matter waves in these devices are Bose-Einstein condensates. A…
Boolean Satisfiability problems are vital components in Electronic Design Automation, particularly within the Logic Equivalence Checking process. Currently, SAT solvers are employed for these problems and neural network is tried as…
Bose-Einstein condensation is a remarkable manifestation of quantum statistics and macroscopic quantum coherence. Superconductivity and superfluidity have their origin in Bose-Einstein condensation. Ultracold quantum gases have provided…
The phase transition to a Bose-Einstein condensate is unusual in that it is not necessarily driven by inter-particle interactions but can occur in an ideal gas as a result of a purely statistical saturation of excited states. However,…
Boolean satisfiability (SAT) problems are routinely solved by SAT solvers in real-life applications, yet solving time can vary drastically between solvers for the same instance. This has motivated research into machine learning models that…
Boolean Satisfiability Problem (SAT) is one of the core problems in computer science. As one of the fundamental NP-complete problems, it can be used - by known reductions - to represent instances of variety of hard decision problems.…
We investigate the evolution of Bose-Einstein condensates falling under gravity and bouncing off a mirror formed by a far-detuned sheet of light. After reflection, the atomic density profile develops splitting and interference structures…
We provide an exact solution for the interplay between Bose-Einstein condensation and the Dicke-Hepp-Lieb self-organization transition of an ideal Bose gas trapped inside a single-mode optical cavity and subject to a transverse laser drive.…
The Boolean Satisfiability (SAT) problem is the canonical NP-complete problem and is fundamental to computer science, with a wide array of applications in planning, verification, and theorem proving. Developing and evaluating practical SAT…
We present efficient counting and sampling algorithms for random $k$-SAT when the clause density satisfies $\alpha \le \frac{2^k}{\mathrm{poly}(k)}.$ In particular, the exponential term $2^k$ matches the satisfiability threshold…
We numerically calculate the density profile and excitation spectrum of a two-species Bose-Einstein condensate for the parameters of recent experiments. We find that the ground state density profile of this system becomes unstable in…