Semi-Random 2-CNF Formula
A formula model in SAT theory that lies between purely random formulas and fully structured formulas: the underlying graph structure of the clauses may be non-random, while the clauses themselves are generated randomly.
Timeline (last 90 days)
The paper proves the speedup mainly for three classes of instances: formulas with many biased variables, semi-random 2-CNF formulas, and Max-Cut on regular expander graphs and stochastic block model graphs.
For semi-random 2-CNF formulas, the new algorithm remains exact and completes in O*(2^{(1-γ)n}) time with high probability.
All Facts (2)
The paper proves the speedup mainly for three classes of instances: formulas with many biased variables, semi-random 2-CNF formulas, and Max-Cut on regular expander graphs and stochastic block model graphs.
50%UnverifiedFor semi-random 2-CNF formulas, the new algorithm remains exact and completes in O*(2^{(1-γ)n}) time with high probability.
50%