PLS-complete problems with lexicographic cost functions: Max-$k$-SAT and Abelian Permutation Orbit Minimization

Documenti analoghi

• PLS-completeness of string permutations
  di: Scheder, Dominik, et al.
  Pubblicazione: (2025)
• Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
  di: Austrin, Per, et al.
  Pubblicazione: (2024)
• A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT
  di: Buhrman, Harry, et al.
  Pubblicazione: (2025)
• On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
  di: S., Karthik C., et al.
  Pubblicazione: (2024)
• Self-referential instances of the dominating set problem are irreducible
  di: Zhou, Guangyan
  Pubblicazione: (2026)