Similar Items: Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
- On Sampling Lower Bounds for Polynomials
- Lower Bounds for Approximate Sign Rank
- From Gödel incompleteness to the consistency of circuit lower bounds
- Tight Lower Bound for Approximating Parametrized Maximum Likelihood Decoding under ETH
- Hard CNF Instances for Ideal Proof Systems
- Multi-Prover Interactive Proof Systems with Leakage