Similar Items: Hard CNF Instances for Ideal Proof Systems
- Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity
- Multi-Prover Interactive Proof Systems with Leakage
- Hardness Amplification for (Sparse) LPN
- Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference
- Hard-to-Sample Distributions from Robust Extractors
- Optimal Union Probability Interval Is NP-Hard