Implementation of branch and bound algorithm for maximum clique problem
-
Updated
Dec 16, 2017 - Python
Implementation of branch and bound algorithm for maximum clique problem
A diabolic implementation of mcSAT 😈
Coverts a generic Verilog netlist into the DIMACS format compatible with many SAT solvers
A generic SAT solver designed to solve SAT problems in the DIMACS format.
Conversor to WPM(1,3), dimacs format
A program which will read a sudoku puzzle from a file (some examples are sudoku1.txt, sudoku2.txt, etc) and generate clauses in the DIMACS format for each sudoku puzzle in the files sudokuN.cnf, where N = 1, 2, ..., 5.
Un projet pour résoudre une grille de Tetravex en utilisant la logique propositionnelle.
Projeto criado para disciplina Inteligência Artificial, Com objetivo de calcular uma rota entre os dois pontos usando os seguintes algoritmos: ○ Busca em Largura ○ Busca em profundidade (podendo ser o limitado) ○ Busca de custo uniforme ○ A*
Script para encontrar o caminho mínimo em grafos no formato DIMACS
Almost Perfectly Non-linear (APN) S-box problem generator
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."