Subset advice provably reduces the exponential base of PPSZ for k-SAT and lifts MAX-SAT approximation from alpha to alpha + (1-alpha)*epsilon, while noisy label advice gives near-optimal MAX-2-SAT on high-average-degree instances.
https://algorithms-with-predictions.github.io/, 2023
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Learning-Augmented Algorithms for Boolean Satisfiability
Subset advice provably reduces the exponential base of PPSZ for k-SAT and lifts MAX-SAT approximation from alpha to alpha + (1-alpha)*epsilon, while noisy label advice gives near-optimal MAX-2-SAT on high-average-degree instances.