Bosphorus, ANF simplifier and solver, and ANF-to-CNF converter
-
Updated
Oct 25, 2024 - C++
Bosphorus, ANF simplifier and solver, and ANF-to-CNF converter
Graph grounding for graph coloring algorithms such as Welsh Powell and Evolution algorithms like Harmony Search and Genetic
Implementation of branch and bound algorithm for maximum clique problem
CGen is a tool for encoding SHA-1 and SHA-256 hash functions into CNF in DIMACS format, also into ANF polynominal system in PolyBoRi output format.
Genetic Algorithm for the Maximum Clique Problem
A diabolic implementation of mcSAT 😈
LibMVC is a collection of fast iterative minimum vertex cover solvers. Currently NuMVC and FastVC are implemented.
a collection of benchmarks (in DIMACS format) for various NP-Complete problems
Results of popular Steiner tree instances
Windows builds for The Glucose SAT Solver.
Compile MiniSat to WebAssembly using emscripten
A simple theorem prover made for a university programming assignment
Coverts a generic Verilog netlist into the DIMACS format compatible with many SAT solvers
Compile microsat to WebAssembly using emscripten
An implementation of a recursive DPLL solver in OCaml. It parses setup (cnf ) DIMACS and checks if the formula is satisfied.
Add a description, image, and links to the dimacs topic page so that developers can more easily learn about it.
To associate your repository with the dimacs topic, visit your repo's landing page and select "manage topics."