Similar Items: On the Complexity of the Minimum-($k,ρ$)-Shortcut Problem
- When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs?
- Continuous Defensive Domination Problems
- The Complexity of Stoquastic Sparse Hamiltonians
- On the Induced Norms of Matrices and Grothendieck problems
- Quantum state isomorphism problems for groups
- Maximum Matching and Related Problems in Catalytic Logspace