← all datasets

3-SAT

Emerging
2papers using it
2024first seen

The '3-SAT' dataset/benchmark contains instances of the Boolean satisfiability problem where each clause has exactly three literals, and it is used to evaluate the performance of optimization algorithms, particularly in the context of quantum annealing.

🔎 Find this dataset

Papers using 3-SAT (1)

3-SAT dataset — papers, benchmarks & downloads · Quantum Computing