Determining unit distance graphs with coordinates in $\mathbb{Z}^2$ is NP-complete

Documenti analoghi

• BusOut is NP-complete
  di: Ishibashi, Takehiro, et al.
  Pubblicazione: (2025)
• Scheme-theoretic Approach to Computational Complexity II. The Separation of P and NP over $\mathbb{C}$, $\mathbb{R}$, and $\mathbb{Z}$
  di: Çivril, Ali
  Pubblicazione: (2021)
• Freeze-Tag is NP-hard in 2D with $L_1$ distance
  di: Silva, Lucas de Oliveira, et al.
  Pubblicazione: (2025)
• Limit-sure reachability for small memory policies in POMDPs is NP-complete
  di: Asadi, Ali, et al.
  Pubblicazione: (2024)
• Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs
  di: Johnson, Matthew, et al.
  Pubblicazione: (2022)