A recursive algorithm with backtracking in Java to solve the NP problem of SAT solving.
-
Updated
Mar 1, 2024 - Java
#
np-problem
Here are 3 public repositories matching this topic...
Compares an algorithm that solves the K-Clique problem exponentially with an algorithm that solves the polynomial transformation to SAT
-
Updated
Feb 24, 2022 - Java
An approach about the NP-Hard problem: Partition Into Perfect Matchings, in which I worked in the class of Complexity and Algorithms, in Universidad del Norte, which I wanted to share with the world.
-
Updated
Mar 10, 2021 - Java
Improve this page
Add a description, image, and links to the np-problem topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the np-problem topic, visit your repo's landing page and select "manage topics."