Reductions of SHA family hash functions to SAT.
-
Updated
Dec 11, 2018 - C
8000
Reductions of SHA family hash functions to SAT.
Advanced Algorithms | Spring 2021 | DPLL SAT solver for Sudoku
A university scheduling problem solved by reduction to SAT and the use of a SAT solver (minisat).
Solutions to Algorithms for Computationally Hard Problems course labs at AGH University of Krakow
In this assignment we can see an algorithmic implementation for solving the famous "Travelling Salesman Problem". This implementation uses a SAT reduction and solves it using a given SAT solver.
Add a description, image, and links to the sat-reduction topic page so that developers can more easily learn about it.
To associate your repository with the sat-reduction topic, visit your repo's landing page and select "manage topics."