類似資料

• On the Mysteries of MAX NAE-SAT
  著者:: Brakensiek, Joshua, 等
  出版事項: (2020)
• MAX BISECTION might be harder to approximate than MAX CUT
  著者:: Brakensiek, Joshua, 等
  出版事項: (2025)
• New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs
  著者:: Brakensiek, Joshua, 等
  出版事項: (2026)
• Hardness of sampling for the anti-ferromagnetic Ising model on random graphs
  著者:: Huang, Neng, 等
  出版事項: (2024)
• Multiway Cuts with a Choice of Representatives
  著者:: Bérczi, Kristóf, 等
  出版事項: (2024)