Search Results for author:
Found 1 papers, 0 papers with code
Decomposing Hard SAT Instances with Metaheuristic Optimization
If $B$ is an arbitrary subset of the set of variables occurring in a SAT formula $C$, and $A$ is an arbitrary complete SAT solver , then the d-hardness expresses an estimate of the hardness of $C$ w. r. t.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
