ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A 33-SAT formula is called satisfiable if all its clauses can be satisfied, and it has at most a 1−ϵ1-\epsilon fraction of satisfiable clauses if no assignment satisfies more than that fraction. Here nn denotes the number of clauses.

Gap-ETH. There exist constants ϵ,c>0\epsilon,c>0 such that no algorithm running in time O(2cn)O(2^{cn}) can distinguish between a satisfiable 33-SAT formula and a 33-SAT formula with at most a 1−ϵ1-\epsilon fraction of satisfiable clauses.

Gap-ETH is a stronger quantitative variant of the Exponential Time Hypothesis used to establish algorithmic lower bounds. Under ordinary ETH, Dinur's quasilinear-length PCP gives a weaker lower bound; a linear-length PCP would imply Gap-ETH from ETH.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.