Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs

Documenti analoghi

• Sharp Online Hardness for Large Balanced Independent Sets
  di: Dhawan, Abhishek, et al.
  Pubblicazione: (2025)
• The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs
  di: Dhawan, Abhishek, et al.
  Pubblicazione: (2024)
• Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
  di: Gamarnik, David, et al.
  Pubblicazione: (2026)
• Optimal Hardness of Online Algorithms for Large Independent Sets
  di: Gamarnik, David, et al.
  Pubblicazione: (2025)
• Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers
  di: R., Abhishek Hegade K., et al.
  Pubblicazione: (2025)