Related papers: Phase Transition in Unrestricted Random SAT

Microcanonical statistics can be well applied to non-extensive systems like nuclei, atomic clusters and systems at phase transitions of first order with inhomogeneous configurations like phase separation. No thermodynamic limit has to be…

We consider several types of quantum critical phenomena from finite-density gauge-gravity duality which to different degrees lie outside the Landau-Ginsburg-Wilson paradigm. These include: (1) a "bifurcating" critical point, for which the…

We study the structure of satisfying assignments of a random 3-SAT formula. In particular, we show that a random formula of density 4.453 or higher almost surely has no non-trivial "core" assignments. Core assignments are certain partial…

In this paper we describe how to modify GSAT so that it can be applied to non-clausal formulas. The idea is to use a particular ``score'' function which gives the number of clauses of the CNF conversion of a formula which are false under a…

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 Boolean Satisfiability problem (SAT) in the framework of diversity, where one asks for multiple solutions that are mutually far apart (i.e., sufficiently dissimilar from each other) for a suitable notion of…

Exact conditional tests for contingency tables require sampling from fibers with fixed margins. Classical Markov basis MCMC is general but often impractical: computing full Markov bases that connect all fibers of a given constraint matrix…

Conformal prediction (CP) constructs prediction sets with marginal coverage guarantees under the assumption that the calibration and test distributions are identical. However, under distribution shift, existing approaches primarily align…

The practical success of Boolean Satisfiability (SAT) solvers stems from the CDCL (Conflict-Driven Clause Learning) approach to SAT solving. However, from a propositional proof complexity perspective, CDCL is no more powerful than the…

Circuit Satisfiability (CSAT) plays a pivotal role in Electronic Design Automation. The standard workflow for solving CSAT problems converts circuits into Conjunctive Normal Form (CNF) and employs generic SAT solvers powered by…

Let F be a uniformly distributed random k-SAT formula with n variables and m clauses. Non-constructive arguments show that F is satisfiable for clause/variable ratios m/n< r(k)~2^k ln 2 with high probability. Yet no efficient algorithm is…

It is well known that, as $n$ tends to infinity, the probability of satisfiability for a random 2-SAT formula on $n$ variables, where each clause occurs independently with probability $\alpha/2n$, exhibits a sharp threshold at $\alpha=1$.…

Quantum dots with large Thouless number $g$ embody a regime where both disorder and interactions can be treated nonperturbatively using large-N techniques (with $N=g$) and quantum phase transitions can be studied. Here we focus on dots…

We study the quantum phase transition of the (1+1)-dimensional O(3) nonlinear sigma model at finite density using the tensor renormalization group method. This model suffers from the sign problem, which has prevented us from investigating…

We propose a new method named the Conditional Randomization Rank Test (CRRT) for testing conditional independence of a response variable Y and a covariate variable X, conditional on the rest of the covariates Z. The new method generalizes…

Applying pre- and inprocessing techniques to simplify CNF formulas both before and during search can considerably improve the performance of modern SAT solvers. These algorithms mostly aim at reducing the number of clauses, literals, and…

We study an Achlioptas-process version of the random k-SAT process: a bounded number of k-clauses are drawn uniformly at random at each step, and exactly one added to the growing formula according to a particular rule. We prove the…

We show that for a randomly sampled unsatisfiable $O(\log n)$-CNF over $n$ variables the randomized two-party communication cost of finding a clause falsified by the given variable assignment is linear in $n$.

Estimating the unknown density from which a given independent sample originates is more difficult than estimating the mean, in the sense that for the best popular non-parametric density estimators, the mean integrated square error converges…

The $k$-SAT problem for \L{}-clausal forms has been found to be NP-complete if $k\geq 3$. Similar to Boolean CNF formulas, \L{}-clausal forms are important from a theoretical and practical points of view for their expressive power,…