solving Random 3-SAT(Boolean satisfiability problem) using simulated annealing.
-
Updated
Nov 3, 2023 - Python
solving Random 3-SAT(Boolean satisfiability problem) using simulated annealing.
A Certifier algorithm to check a particular solution to the NP-Complete 3-Sat problem
Contains the assignment 1,2,3 and 4
C++ 3-SAT Simulated Annealing Solver
Java implementation of a total unimodularity based branch and bound method for boolean integer programming
Bachelor's thesis: Solving the 3-SAT problem using quantum algorithms
Add a description, image, and links to the 3-sat topic page so that developers can more easily learn about it.
To associate your repository with the 3-sat topic, visit your repo's landing page and select "manage topics."