Similar Items: From Gödel incompleteness to the consistency of circuit lower bounds
- On Sampling Lower Bounds for Polynomials
- Lower Bounds for Approximate Sign Rank
- Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
- Average Attention Transformers and Arithmetic Circuits
- Exponential-Size Circuit Complexity is Comeager in Symmetric Exponential Time
- Constructive Separations from Gate Elimination