Max-3SAT problem
Emerging2papers using it
2024first seen
The Max3SAT problem is a computational problem that involves determining the maximum number of satisfied clauses in a Boolean formula expressed in conjunctive normal form with at most three literals per clause, and it is used to evaluate the performance of quantum Hamiltonian simulations.