Metraipolis › archive › dc_b60b7ecda9ad
Strongly Refuting Semirandom Linear Systems in Subexponential Time — arXiv:2609.30052
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.30052
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T07:26:43.838Z
- SHA-256 of the archived text
a3a09ae7747bf450b44cad1f11249b2d4e515910d97aef80ac99f623bae93262- Stable URL of this page
https://metraipolis.com/documento/dc_b60b7ecda9ad
How to cite
Strongly Refuting Semirandom Linear Systems in Subexponential Time — arXiv:2609.30052 — arXiv (en), https://arxiv.org/abs/2609.30052 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b60b7ecda9ad (Metraipolis archive dc_b60b7ecda9ad, sha256 a3a09ae7747bf450b44cad1f11249b2d4e515910d97aef80ac99f623bae93262)
BibTeX
@misc{dcb60b7ecda9ad,
title = {Strongly Refuting Semirandom Linear Systems in Subexponential Time — arXiv:2609.30052},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.30052},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b60b7ecda9ad; sha256 a3a09ae7747bf450b44cad1f11249b2d4e515910d97aef80ac99f623bae93262},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30052. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper, we consider the problem of refuting $\mathbb{F}_2$-linear equations with random right-hand sides. Formally, we give a sub-exponential $2^{O(n/\log n)}$-time randomized algorithm that takes as input an arbitrary $m \times n$ matrix $A$ and a uniformly random vector $b \in \mathbb{F}_2^m$, and outputs a witness showing that no assignment satisfies more than a $\frac{1}{2}+\epsilon$ fraction of the equations provided that $m \geq 2^{O(n/\log n)}$. The setting above is the semirandom refutation variant of the famous work [BKW03] that gives a $2^{O(n/\log n)}$-time search algorithm for the learning parity with noise (LPN) problem with $m \geq 2^{O(n/\log n)}$ equations. Building on the search algorithm of [Lyub05], we also give a $2^{O(n/\log \log n)}$-time refutation algorithm that succeeds with only $m \geq n^{1 + \gamma}$ equations, for a small constant $\gamma$. Finally, we prove that our algorithm is not captured by the sum-of-squares hierarchy by proving a degree-$\Omega(n)$ sum-of-squares lower bound, showing that ''[BKW03]-style'' algorithms achieve better runtime than can be done under sum-of-squares. We thus obtain a natural example of a noise-tolerant signal recovery problem that exhibits a nontrivial gap between the performance of efficient algorithms and that of those based on the sum-of-squares hierarchy.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.30052 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T06:44:29.094Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).