Random local access for sampling k-SAT solutions

Documenti analoghi

• Counting random $k$-SAT near the satisfiability threshold
  di: Chen, Zongchen, et al.
  Pubblicazione: (2024)
• Strong spatial mixing for colorings on trees and its algorithmic applications
  di: Chen, Zongchen, et al.
  Pubblicazione: (2023)
• Asymptotically Optimal Inapproximability of E$k$-SAT Reconfiguration
  di: Hirahara, Shuichi, et al.
  Pubblicazione: (2025)
• An algorithm with a delay of $\mathcal{O}(kΔ)$ for enumerating connected induced subgraphs of size $k$
  di: Xiao, Chenglong, et al.
  Pubblicazione: (2024)
• Online Graph Coloring for $k$-Colorable Graphs
  di: Kawarabayashi, Ken-ichi, et al.
  Pubblicazione: (2025)