SAT formulas with (λ,p)_k-structures admit sub-exponential Gap-SAT algorithms whose speedup is controlled by the spread parameter λ, via hypergraph containers.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2verdicts
UNVERDICTED 2representative citing papers
An asymptotic expansion is derived for the expected number of independent sets in percolated regular bipartite graphs via the Ising model and cluster expansion, extending prior hypercube work.
citing papers explorer
-
A Hypergraph Container Method on Spread SAT: Approximation and Speedup
SAT formulas with (λ,p)_k-structures admit sub-exponential Gap-SAT algorithms whose speedup is controlled by the spread parameter λ, via hypergraph containers.
-
Counting independent sets in percolated graphs via the Ising model
An asymptotic expansion is derived for the expected number of independent sets in percolated regular bipartite graphs via the Ising model and cluster expansion, extending prior hypercube work.