There are no reviews yet. Be the first to send feedback to the community and the maintainers!
Repository Details
This project focuses on computability theory & heuristics. The program provides several approach for 0-1Knapsack and use them to NP-Complete problem, namely 3SAT (which is reduced subsequently into 1in3SAT, and SubsetSum).
