Super Strong ETH is False for Random k-SAT

10/14/2018
by   Nikhil Vyas, et al.
0

It has been hypothesized that k-SAT is hard to solve for randomly chosen instances near the "critical threshold", where the clause-to-variable ratio is 2^k 2-θ(1). Feige's hypothesis for k-SAT says that for all sufficiently large clause-to-variable ratios, random k-SAT cannot be refuted in polynomial time. It has also been hypothesized that the worst-case k-SAT problem cannot be solved in 2^n(1-ω_k(1)/k) time, as multiple known algorithmic paradigms (backtracking, local search and the polynomial method) only yield an 2^n(1-1/O(k)) time algorithm. This hypothesis has been called the "Super-Strong ETH", modeled after the ETH and the Strong ETH. Our main result is a randomized algorithm which refutes the Super-Strong ETH for the case of random k-SAT, for any clause-to-variable ratio. Given any random k-SAT instance F with n variables and m clauses, our algorithm decides satisfiability for F in 2^n(1-Ω( k)/k) time, with high probability. It turns out that a well-known algorithm from the literature on SAT algorithms does the job: the PPZ algorithm of Paturi, Pudlak, and Zane (1998).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/31/2019

A Model of Random Industrial SAT

One of the most studied models of SAT is random SAT. In this model, inst...
research
04/09/2019

Bridging between 0/1 and Linear Programming via Random Walks

Under the Strong Exponential Time Hypothesis, an integer linear program ...
research
06/01/2011

Backbone Fragility and the Local Search Cost Peak

The local search algorithm WSat is one of the most successful algorithms...
research
09/09/2021

Algorithms and Certificates for Boolean CSP Refutation: "Smoothed is no harder than Random"

We present an algorithm for strongly refuting smoothed instances of all ...
research
05/22/2023

Empirical Challenge for NC Theory

Horn-satisfiability or Horn-SAT is the problem of deciding whether a sat...
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
07/04/2023

Heuristic Algorithms for the Approximation of Mutual Coherence

Mutual coherence is a measure of similarity between two opinions. Althou...

Please sign up or login with your details

Forgot password? Click here to reset