Similar Items: Proof Systems Based on Structured Circuits
- Hard CNF Instances for Ideal Proof Systems
- Multi-Prover Interactive Proof Systems with Leakage
- Average Attention Transformers and Arithmetic Circuits
- Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference
- Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
- From Gödel incompleteness to the consistency of circuit lower bounds