Similar Items: When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs?
- Boolean PCSPs through the lens of Fourier Analysis
- The two clocks and the innovation window: When and how generative models learn rules
- Polynomial-time completion of phylogenetic tree sets
- On the Complexity of Discounted Robust MDPs with $L_p$ Uncertainty Sets
- The Exact Replica Threshold for Nonlinear Moments of Quantum States
- On the Hardness of Finding Temporally Connected Subgraphs of Any Size