There are 0 repository under npcomplete topic.
Programming assignments for the Stanford University Algorithms Specialization
Solutions for problems sets and algorithms taught in Stanford's Algorithms Specialization at Coursera.
This unit introduces formal languages, models of computation, and computational complexity. Topics include finite state automata, regular expressions, grammars, pushdown automata, computable functions, Turing machines, polynomial-time reductions, complexity classes P and NP, and NP-completeness.
An analysis of a NP-Complete Graph Colouring problem 3-Colourability and an approximate algorithm analysis that solves 3-COL.
Incomplete code and documents explaining the mappings from Nonograms to SAT and SAT to Nonograms
This repository showcases visualizations of 2 classic np-complete problems: nqueens and knight's tour.
Comprehensive analysis of the NP-Complete problem k-Clique
A fast algorithm for solving the Graph Coloring problem and its generalizations (Bandwidth Coloring, Multi Coloring, and Bandwidth Multi Coloring problems)