MAX-k-SAT

MAX-k-SAT is a benchmark dataset used to evaluate algorithms for solving binary combinatorial optimization problems, specifically focusing on finding high-quality approximate solutions to satisfiability problems involving clauses of up to k literals.

Papers using MAX-k-SAT (2)

Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization2025Local Quantum Search Algorithm for Random $k$-SAT with $\Omega(n^{1+\epsilon})$ Clauses2024 · 1 cites