Similar Items: On the Hardness of Finding Temporally Connected Subgraphs of Any Size
- Hard-to-Sample Distributions from Robust Extractors
- Optimal Union Probability Interval Is NP-Hard
- Hard CNF Instances for Ideal Proof Systems
- Exponential-Size Circuit Complexity is Comeager in Symmetric Exponential Time
- Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
- The Exact Replica Threshold for Nonlinear Moments of Quantum States