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

09/12/2018
by   Sixue Liu, et al.
0

We study upper bounds for the running time of algorithms for NAE-k-SAT and MAX-NAE-k-SAT approximation, as functions of k, the number of variables n and the performance ratio δ. For the first time, deterministic NAE-k-SAT algorithm is faster than the best k-SAT algorithm. The analysis relies on Linear Programming. However we do not know such improvement for randomized algorithms. As for approximation algorithms, we show that a number of MAX-k-SAT algorithms do not apply to MAX-NAE-k-SAT, including the current best one. We present a better MAX-NAE-k-SAT approximation algorithm, which is even faster than the best MAX-k-SAT approximation algorithm in a wide range of δ when k = 3. We also provide a tighter analysis on an existing MAX-k-SAT approximation algorithm, and generalize it for MAX-NAE-k-SAT, which is currently the best for all k > 4.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/22/2020

On the Mysteries of MAX NAE-SAT

MAX NAE-SAT is a natural optimization problem, closely related to its be...
research
09/12/2018

Exponential-Time Approximation Algorithms for MAX-SAT: Correlations and Implications

We provide three different algorithms for MAX-SAT approximation. Each of...
research
04/21/2018

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

We present the current fastest deterministic algorithm for k-SAT, improv...
research
05/14/2021

A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm

We show that for every r ≥ 2 there exists ϵ_r > 0 such that any r-unifor...
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/28/2017

Adapting Sequential Algorithms to the Distributed Setting

In this paper we aim to define a robust family of sequential algorithms ...
research
02/14/2023

Lightsolver challenges a leading deep learning solver for Max-2-SAT problems

Maximum 2-satisfiability (MAX-2-SAT) is a type of combinatorial decision...

Please sign up or login with your details

Forgot password? Click here to reset