類似資料

• Kernelization Complexity of Solution Discovery Problems
  著者:: Grobler, Mario, 等
  出版事項: (2024)
• Complexity of Paired Domination Problems on Circle and $k$-Polygon Graphs
  著者:: Mu, Ta-Yu, 等
  出版事項: (2024)
• NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing
  著者:: Gaspers, Serge, 等
  出版事項: (2025)
• Finding One Local Optimum Is Easy -- but What About Two?
  著者:: Kobayashi, Yasuaki, 等
  出版事項: (2025)
• Computing the $D$-base and $D$-relation in finite closure systems
  著者:: Adaricheva, Kira, 等
  出版事項: (2024)