Generalizing Brooks' theorem via Partial Coloring is Hard Classically and Locally

Ähnliche Einträge

• On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
  von: Lingas, Andrzej
  Veröffentlicht: (2026)
• A Tight Meta-theorem for LOCAL Certification of MSO$_2$ Properties within Bounded Treewidth Graphs
  von: Cook, Linda, et al.
  Veröffentlicht: (2025)
• A Note on Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds of the Congested Clique
  von: Lingas, Andrzej
  Veröffentlicht: (2024)
• GenTT: Generate Vectorized Codes for General Tensor Permutation
  von: Chen, Yaojian, et al.
  Veröffentlicht: (2025)
• Clock Synchronization Is Almost Impossible with Bounded Memory
  von: Charron-Bost, Bernadette, et al.
  Veröffentlicht: (2024)