Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT

04/21/2018
by   Sixue Liu, et al.
0

We present the current fastest deterministic algorithm for k-SAT, improving the upper bound (2-2/k)^n + o(n) due to Moser and Scheder in STOC 2011. The algorithm combines a branching algorithm with the derandomized local search, whose analysis relies on a special sequence of clauses called chain, and a generalization of covering code based on linear programming. We also provide a more intelligent branching algorithm for 3-SAT to establish the upper bound 1.32793^n, improved from 1.3303^n.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/12/2018

The Curse and Blessing of Not-All-Equal in k-Satisfiability

We study upper bounds for the running time of algorithms for NAE-k-SAT a...
research
12/15/2022

A Graphical #SAT Algorithm for Formulae with Small Clause Density

We study the counting version of the Boolean satisfiability problem #SAT...
research
04/16/2018

A Bound on the Shannon Capacity via a Linear Programming Variation

We prove an upper bound on the Shannon capacity of a graph via a linear ...
research
01/17/2020

Simpler Partial Derandomization of PPSZ for k-SAT

We give a simpler derandomization of the best known k-SAT algorithm PPSZ...
research
11/03/2021

Effective guessing has unlikely consequences

A classic result of Paul, Pippenger, Szemerédi and Trotter states that D...
research
07/22/2022

PPSZ is better than you think

PPSZ, for long time the fastest known algorithm for k-SAT, works by goin...
research
02/19/2019

Learning Optimal Linear Regularizers

We present algorithms for efficiently learning regularizers that improve...

Please sign up or login with your details

Forgot password? Click here to reset