A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm

05/14/2021
by   Michal Koucký, et al.
0

We show that for every r ≥ 2 there exists ϵ_r > 0 such that any r-uniform hypergraph on m edges with bounded vertex degree has a set of at most (1/2 - ϵ_r)m edges the removal of which breaks the hypergraph into connected components with at most m/2 edges. We use this to give an algorithm running in time d^(1 - ϵ_r)m that decides satisfiability of m-variable (d, k)-CSPs in which every variable appears in at most r constraints, where ϵ_r depends only on r and k∈ o(√(m)). Furthermore our algorithm solves the corresponding #CSP-SAT and Max-CSP-SAT of these CSPs. We also show that CNF representations of unsatisfiable (2, k)-CSPs with variable frequency r can be refuted in tree-like resolution in size 2^(1 - ϵ_r)m. Furthermore for Tseitin formulas on graphs with degree at most k (which are (2, k)-CSPs) we give a deterministic algorithm finding such a refutation.

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
09/21/2020

Connected Fair Detachments of Hypergraphs

Let 𝒢 be a hypergraph whose edges are colored. An (α,n)-detachment of 𝒢 ...
research
05/24/2021

GraphSAT – a decision problem connecting satisfiability and graph theory

Satisfiability of boolean formulae (SAT) has been a topic of research in...
research
09/26/2019

Interactive Particle Systems on Hypergraphs, Drift Analysis and the WalkSAT algorithm

We analyze the expected running time of WalkSAT, a well-known local sear...
research
06/10/2023

Linear saturation numbers of Berge-C_3 and Berge-C_4

The linear saturation number sat^lin_k(n,ℱ) (linear extremal number ex^l...
research
05/13/2019

Satisfiability Threshold for Power Law Random 2-SAT in Configuration Model

The Random Satisfiability problem has been intensively studied for decad...
research
07/22/2022

PPSZ is better than you think

PPSZ, for long time the fastest known algorithm for k-SAT, works by goin...

Please sign up or login with your details

Forgot password? Click here to reset