Fine-Grained 0 Lower Bounds for k-OV, k-XOR, and k-SUM via Colored Subgraph Isomorphism
cs.CC
Submitted: 2026-08-09
Updated: 2026-10-20
Related papers
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- Optimal Unambiguous DNFs and Alon-Saks-Seymour
- On the Limits of Quantum Multiparty Simultaneous Communication
- Learning, Compression, and Meta-Complexity
- Hardware-Algorithm Co-Optimization of Early-Exit Neural Networks for Multi-Core Edge Accelerators
- Quantum Fine-Grained Lower Bounds for SetDisjointness via Sub-Linear Reductions from 3SUM