Conceptio
›
Archive
›
arXiv (All)
arXiv (All)
open access
Fine-Grained $\mathrm{AC}^0$ Lower Bounds for $k$-$\mathrm{OV}$, $k$-$\mathrm{XOR}$, and $k$-$\mathrm{SUM}$ via Colored Subgraph Isomorphism
Lin, Haoxing
arXiv (All) · Papers · License: Open Access
Open Source ↗
Direct PDF ↓
computational-complexity
computational complexity
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record
· ID 927418
Retrieved via
Conceptio
— every document is proof-bundled with source, license, and retrieval metadata.