AI Chat AI Image Generator AI Video Text to Speech

The Long, the Short and the Random

11/03/2020

∙

by Giorgio Camerani, et al.

∙

∙

We furnish solid evidence, both theoretical and empirical, towards the existence of a deterministic algorithm for random sparse #Ω(log n)-SAT instances, which computes the exact counting of satisfying assignments in sub-exponential time. The algorithm uses a nice combinatorial property that every CNF formula has, which relates its number of unsatisfying assignments to the space of its monotone sub-formulae.

page 1

page 2

page 3

page 4

research

∙ 02/03/2021

The #ETH is False, #k-SAT is in Sub-Exponential Time

We orchestrate a randomized algorithm for #k-SAT which counts the exact ...

0 Giorgio Camerani, et al. ∙

research

∙ 01/10/2018

Deterministic search for CNF satisfying assignments in almost polynomial time

We consider the fundamental derandomization problem of deterministically...

0 Rocco A. Servedio, et al. ∙

research

∙ 02/10/2020

The random 2-SAT partition function

We show that throughout the satisfiable phase the normalised number of s...

0 Dimitris Achlioptas, et al. ∙

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...

0 Andreas Galanis, et al. ∙

research

∙ 01/15/2014

Solving #SAT and Bayesian Inference with Backtracking Search

Inference in Bayes Nets (BAYES) is an important problem with numerous ap...

0 Fahiem Bacchus, et al. ∙

research

∙ 08/28/2017

Two-Dimensional Indirect Binary Search for the Positive One-in-Three Satisfiability Problem

In this paper, we propose an algorithm for the positive one-in-three sat...

0 Shunichi Matsubara, et al. ∙

research

∙ 03/11/2021

Hiding solutions in model RB: Forced instances are almost as hard as unforced ones

In this paper we study the forced instance spaces of model RB, where one...

0 Guangyan Zhou, et al. ∙