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.
Programming assignments for the Stanford University Algorithms Specialization
A parallel, ant-based algorithm for the Maximum Clique problem.
Solutions for problems sets and algorithms taught in Stanford's Algorithms Specialization at Coursera.
An analysis of a NP-Complete Graph Colouring problem 3-Colourability and an approximate algorithm analysis that solves 3-COL.
Solutions to NP-complete problems: N-Queens and Knight's Tour.
Incomplete code and documents explaining the mappings from Nonograms to SAT and SAT to Nonograms
A fast algorithm for solving the Graph Coloring problem and its generalizations (Bandwidth Coloring, Multi Coloring, and Bandwidth Multi Coloring problems)
Comprehensive analysis of the NP-Complete problem k-Clique
Add a description, image, and links to the npcomplete topic page so that developers can more easily learn about it.
To associate your repository with the npcomplete topic, visit your repo's landing page and select "manage topics."