A new coordinatewise balanced covering theorem for linear gain graphs yields a randomized algorithm for Coset-List Min-2-Lin over powers of two with runtime exponential in k squared times the cycle-label rank rho.
Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, and Magnus Wahlström
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Coordinatewise Balanced Covering for Linear Gain Graphs, with an Application to Coset-List Min-2-Lin over Powers of Two
A new coordinatewise balanced covering theorem for linear gain graphs yields a randomized algorithm for Coset-List Min-2-Lin over powers of two with runtime exponential in k squared times the cycle-label rank rho.