Similar Items: Exponential-Size Circuit Complexity is Comeager in Symmetric Exponential Time
- On the Principal Minor Expansion and Complexity of the Symmetrized Determinant
- Average Attention Transformers and Arithmetic Circuits
- From Gödel incompleteness to the consistency of circuit lower bounds
- On the Hardness of Finding Temporally Connected Subgraphs of Any Size
- The Complexity of Stoquastic Sparse Hamiltonians
- Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size