Colored subgraph isomorphism projects by depth-zero reductions to k-OV, odd-k k-XOR, and k-SUM, yielding unconditional AC0 lower bounds n^{Ω(k)} for fixed k and n^{Ω_d(min{sqrt k, log n})} for growing k.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism
Colored subgraph isomorphism projects by depth-zero reductions to k-OV, odd-k k-XOR, and k-SUM, yielding unconditional AC0 lower bounds n^{Ω(k)} for fixed k and n^{Ω_d(min{sqrt k, log n})} for growing k.