Related papers: Order-to-chaos transition in the hardness of rando…
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…
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…
A fundamental question in Computer Science is understanding when a specific class of problems go from being computationally easy to hard. Because of its generality and applications, the problem of Boolean Satisfiability (aka SAT) is often…
Chaos is an inherently dynamical phenomenon traditionally studied for trajectories that are either permanently erratic or transiently influenced by permanently erratic ones lying on a set of measure zero. The latter gives rise to the final…
The mathematical structure of the widely popular Sudoku puzzles is akin to typical hard constraint satisfaction problems that lie at the heart of many applications, including protein folding and the general problem of finding the ground…
Heuristic methods for solution of problems in the NP-Complete class of decision problems often reach exact solutions, but fail badly at "phase boundaries", across which the decision to be reached changes from almost always having one value…
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 structural phase transitions and computational complexity of random 3-SAT instances are traditionally described using thermodynamic analogies from statistical physics, such as Replica Symmetry Breaking and energy landscapes. While…
Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. If there are m constraints over n variables there is typically a large range of densities r=m/n where solutions are known to exist with…
We consider transitions to chaos in random dynamical systems induced by an increase of noise amplitude. We show how the emergence of chaos (indicated by a positive Lyapunov exponent) in a logistic map with bounded additive noise can be…
We propose a new diagnostic for quantum chaos. We show that time evolution of complexity for a particular type of target state can provide equivalent information about the classical Lyapunov exponent and scrambling time as out-of-time-order…
Recently, the phenomenon of quantum-classical correspondence breakdown was uncovered in optomechanics, where in the classical regime the system exhibits chaos but in the corresponding quantum regime the motion is regular - there appears to…
The relation between the onset of chaos and critical phenomena, like Quantum Phase Transitions (QPT) and Excited-State Quantum Phase transitions (ESQPT), is analyzed for atom-field systems. While it has been speculated that the onset of…
Chaos and complexity entail an entropic and computational obstruction to describing a system, and thus are intrinsically difficult to characterize. In this paper, we consider time evolution by Gaussian Unitary Ensemble (GUE) Hamiltonians…
The random K-satisfiability (K-SAT) problem is an important problem for studying typical-case complexity of NP-complete combinatorial satisfaction; it is also a representative model of finite-connectivity spin-glasses. In this paper we…
Phase transition is an important feature of SAT problem. For random k-SAT model, it is proved that as r (ratio of clauses to variables) increases, the structure of solutions will undergo a sudden change like satisfiability phase transition…
We study the relationship between quantum chaos and pseudorandomness by developing probes of unitary design. A natural probe of randomness is the "frame potential," which is minimized by unitary $k$-designs and measures the $2$-norm…
Chaos, in quantum systems, can be diagnosed by certain out-of-time-order correlators (OTOCs) that obey the chaos bound of Maldacena, Shenker, and Stanford (MSS). We begin by deriving a dispersion relation for this class of OTOCs, implying…
The Random K-Satisfiability Problem, consisting in verifying the existence of an assignment of N Boolean variables that satisfy a set of M=alpha N random logical clauses containing K variables each, is studied using the replica symmetric…
In this short paper we present a survey of some results concerning the random SAT problems. To elaborate, the Boolean Satisfiability (SAT) Problem refers to the problem of determining whether a given set of $m$ Boolean constraints over $n$…