infinity Is NP-Hard for Power-of-two Cyclotomic Ideals
cs.CC
Submitted: 2026-11-10
Updated: 2026-11-10
Code: https://github.com/fffmath/pow2-c
Terminology
Sources
- SVP Is NP-Hard for Some Rank-2 Cyclotomic Modules
- Euclidean SVP is deterministically NP-hard to approximate within any constant factor
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?