Related papers: Scale-Free Random SAT Instances

Randomization tests and flexible treatment-effect models offer complementary strengths for analyzing data from randomized panel experiments: the former provide valid inference under the known assignment mechanism, while the latter can…

Let $\Phi$ be a random $k$-SAT formula in which every variable occurs precisely $d$ times positively and $d$ times negatively. Assuming that $k$ is sufficiently large and that $d$ is slightly below the critical degree where the formula…

We show that the Satisfiability (SAT) problem for CNF formulas with {\beta}-acyclic hypergraphs can be solved in polynomial time by using a special type of Davis-Putnam resolution in which each resolvent is a subset of a parent clause. We…

We propose to use local search algorithms to produce SAT instances which are harder to solve than randomly generated k-CNF formulae. The first results, obtained with rudimentary search algorithms, show that the approach deserves further…

This note considers checking satisfiability of sets of propositional clauses (SAT instances). It shows that "unipolar sets" of clauses (containing no positive or no negative clauses) provide an "early sign" of satisfiability of SAT…

We study parameter inference in simulation-based stochastic models where the analytical form of the likelihood is unknown. The main difficulty is that score evaluation as a ratio of noisy Monte Carlo estimators induces bias and instability,…

The main result of this paper is that there are examples of stochastic partial differential equations [hereforth, SPDEs] of the type $$ \partial_t u=\frac12\Delta u +\sigma(u)\eta \qquad\text{on $(0\,,\infty)\times\mathbb{R}^3$}$$ such that…

The Boolean Satisfiability (SAT) problem stands out as an attractive NP-complete problem in theoretic computer science and plays a central role in a broad spectrum of computing-related applications. Exploiting and tuning SAT solvers under…

We propose a plasma model for spectral statistics displaying level repulsion without long-range spectral rigidity, i.e. statistics intermediate between random matrix and Poisson statistics similar to the ones found numerically at the…

Much of the recent work on random constraint satisfaction problems has been inspired by ingenious but non-rigorous approaches from physics. The physics predictions typically come in the form of distributional fixed point problems that are…

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…

An analysis of the average-case complexity of solving random 3-Satisfiability (SAT) instances with backtrack algorithms is presented. We first interpret previous rigorous works in a unifying framework based on the statistical physics…

In this work we consider an ensemble of random $\mathbb{Z}^d$-shifts of finite type ($\mathbb{Z}^d$-SFTs) and prove several results concerning the behavior of typical systems with respect to emptiness, entropy, and periodic points. These…

In this paper, we try to further demonstrate that the models of random CSP instances proposed by [Xu and Li, 2000; 2003] are of theoretical and practical interest. Indeed, these models, called RB and RD, present several nice features.…

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…

We construct the $\lambda$-model on $SU(3)_k/U(2)_k$ and we compute the one-loop $\beta$-function for the deformation parameter $\lambda$. Its non-compact version for $SU(2,1)_{-k}/U(2)_{-k}$ is also considered, whose target space admits an…

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…

This paper examines the asymptotic inference for AR(1) models with a possible structural break in the AR parameter $\beta $ near the unity at an unknown time $k_{0}$. Consider the model $y_{t}=\beta_{1}y_{t-1}I\{t\leq k_{0}\}+\beta…

Embedded random matrix ensembles are generic models for describing statistical properties of finite isolated interacting quantum many-particle systems. For the simplest spinless systems, with say $m$ particles in $N$ single particle states…

In this paper we propose a new type of random CSP model, called Model RB, which is a revision to the standard Model B. It is proved that phase transitions from a region where almost all problems are satisfiable to a region where almost all…