Similar Items: Strongly Refuting Random CSP without Literals
- Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs
- Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference
- The Exact Replica Threshold for Nonlinear Moments of Quantum States
- Boolean PCSPs through the lens of Fourier Analysis
- On the Hardness of Finding Temporally Connected Subgraphs of Any Size
- Constructive Separations from Gate Elimination