Programming assignments for the Stanford University Algorithms Specialization
-
Updated
Oct 7, 2023 - Julia
#
npcomplete
Here are 9 public repositories matching this topic...
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.
-
Updated
May 30, 2023 - C
Solutions for problems sets and algorithms taught in Stanford's Algorithms Specialization at Coursera.
rust algorithms graph-algorithms coursera greedy-algorithms specialization divide-and-conquer npcomplete
-
Updated
Jul 9, 2022 - Rust
A parallel, ant-based algorithm for the Maximum Clique problem.
-
Updated
Sep 3, 2023 - C++
Solutions to NP-complete problems: N-Queens and Knight's Tour.
-
Updated
Oct 6, 2024 - Java
An analysis of a NP-Complete Graph Colouring problem 3-Colourability and an approximate algorithm analysis that solves 3-COL.
algorithms heuristics algorithm-analysis greedy-algorithms nphard heuristic-algorithm 3-coloring 3-colorability-problem npcomplete
-
Updated
May 18, 2018 - C++
A fast algorithm for solving the Graph Coloring problem and its generalizations (Bandwidth Coloring, Multi Coloring, and Bandwidth Multi Coloring problems)
-
Updated
Sep 2, 2023 - C
Incomplete code and documents explaining the mappings from Nonograms to SAT and SAT to Nonograms
-
Updated
Jun 16, 2023 - Python
Comprehensive analysis of the NP-Complete problem k-Clique
heuristic-algorithm complexity-analysis k-clique brute-force-algorithm experimental-analysis npcomplete
-
Updated
Jul 30, 2023 - C++
Improve this page
Add a description, image, and links to the npcomplete topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the npcomplete topic, visit your repo's landing page and select "manage topics."