← all datasets

random 3-SAT

Emerging
2papers using it
2025first seen

Random 3-SAT is a benchmark consisting of randomly generated Boolean satisfiability problems with three literals per clause, used to evaluate the performance of algorithms in sampling and solving combinatorial optimization problems.

Papers using random 3-SAT (2)

random 3-SAT β€” datasets β€” quantum-computing