Closest string problem. Binary decisional version.
-
Updated
Jun 21, 2022 - C
Closest string problem. Binary decisional version.
Abordaje del desafío NP-Completo del Problema del Viatjant de Comerç en C++ mediante metodologías algorítmicas como Greedy, Backtracking, Branch & Bound y algoritmos probabilísticos.
n-Queens [Completion] problem solver implemented as multithreaded randomized non-recursive backtracking algorithm with dam-pruning
Two homework for the Algorithm Design course (Winter 2020)
Sabanci University CS301 - Algorithms Course Project
The repo of "Exploring the Network of Real-World Passwords: Visualization and Estimation" in SecureComm 2017.
Strip Packing Problem Visualizer
SWIFT implementations of well know algorithmic problems
Explore different algorithms for Maximum 0-1 Knapsack
The championship problem as a NP-complete problem: The application uses an up-to-date soccer league SQLite database to solve the championship problem with different algorithms.
Parallélisation d'un programme séquentiel résolvant une instance du problème de la couverture exacte.
演算法筆記
Problem Solving: A Practical Workbook
A fast heuristic algorithm for solving high-density variants of the subset-sum problem
Distinctly banana. This program generates and solves nxn sudoku puzzles. Puzzle customization included!
Course projects on various NP and NPH problems on CTU in Prague 2021. Knapsack problem with various approaches, analysis of effectivity and robustness. Instances generation and validation. Approximation algorithms (FPTAS) and advanced iterative methods (genetic algorithm, simulated annealing).
Uniform: A Probabilistic SAT Solving Algorithm
ALMA—MWX2SAT Solver
Add a description, image, and links to the np-complete topic page so that developers can more easily learn about it.
To associate your repository with the np-complete topic, visit your repo's landing page and select "manage topics."