arXiv (All)
open access
Strongly Refuting Semirandom Linear Systems in Subexponential Time
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^
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Simple Complexity Lower Bound for Solving $Ax=b$#997848
- The satisfiability threshold of random linear equations over finite commutative rings#1049026
- Uniqueness and stability of nonlinear filtering equations with unbounded random coefficients#1076641
- Matrix-Vector Complexity of Low-Rank Approximation#1130682
- Quantile Randomized Kaczmarz for Streaming Linear Systems with Massart Noise#784744
Record · ID 1078123
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive