Fast sampling and counting k-SAT solutions in the local lemma regime

11/04/2019
by   Weiming Feng, et al.
0

We give new algorithms based on Markov chains to sample and approximately count satisfying assignments to k-uniform CNF formulas where each variable appears at most d times. For any k and d satisfying kd<n^o(1) and k> 20log k + 20log d + 60, the new sampling algorithm runs in close to linear time, and the counting algorithm runs in close to quadratic time. Our approach is inspired by Moitra (JACM, 2019) which remarkably utilizes the Lovász local lemma in approximate counting. Our main technical contribution is to use the local lemma to bypass the connectivity barrier in traditional Markov chain approaches, which makes the well developed MCMC method applicable on disconnected state spaces such as SAT solutions. The benefit of our approach is to avoid the enumeration of local structures and obtain fixed polynomial running times, even if k=ω(1) or d=ω(1).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2022

Fast sampling of satisfying assignments from random k-SAT

We give the first nearly linear time algorithm to approximately sample s...
research
11/08/2020

Sampling Constraint Satisfaction Solutions in the Local Lemma Regime

We give a Markov chain based algorithm for sampling almost uniform solut...
research
12/30/2022

Deterministic counting Lovász local lemma beyond linear programming

We give a simple combinatorial algorithm to deterministically approximat...
research
11/09/2017

Counting hypergraph colorings in the local lemma regime

We give a fully polynomial-time approximation scheme (FPTAS) to count th...
research
07/14/2017

Fine-grained reductions from approximate counting to decision

The main problems in fine-grained complexity are CNF-SAT, the Orthogonal...
research
11/24/2017

Relating counting complexity to non-uniform probability measures

A standard method for designing randomized algorithms to approximately c...
research
11/07/2022

NSNet: A General Neural Probabilistic Framework for Satisfiability Problems

We present the Neural Satisfiability Network (NSNet), a general neural f...

Please sign up or login with your details

Forgot password? Click here to reset