Under ETH, approximating parameterized MLD and NCP within a fixed constant factor requires n^Omega(k) time via a direct reduction from Gap-MAXLIN hardness using cover families.
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Tight Lower Bound for Approximating Parametrized Maximum Likelihood Decoding under ETH
Under ETH, approximating parameterized MLD and NCP within a fixed constant factor requires n^Omega(k) time via a direct reduction from Gap-MAXLIN hardness using cover families.