Hardness Self-Amplification in Linear Algebra and Fine-Grained Cryptography
cs.CC
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- Quantum Worst-Case to Average-Case Reductions for All Linear Problems
- Worst-Case to Average-Case Reductions via Additive Combinatorics
- Multiplying matrices via polynomials: exposition and barriers
- The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs
- The multilinear forms Cayley graph and the eigenvalue method for tensor codes
- Matrix Multiplication Reductions
- Improving Algorithmic Efficiency using Cryptography
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?