Similar Items: Hardness Amplification for (Sparse) LPN
- The Complexity of Stoquastic Sparse Hamiltonians
- Hard-to-Sample Distributions from Robust Extractors
- Optimal Union Probability Interval Is NP-Hard
- Hard CNF Instances for Ideal Proof Systems
- On the Hardness of Finding Temporally Connected Subgraphs of Any Size
- Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity