Complexity
-
Updated
Dec 20, 2024 - Python
Complexity
Proof of concept for "TSP Escapes the O(2^n n^2) Curse" -- First improvement after more than 60 years
⚛️ MIT iquHACK QuEra Challenge Submission (Winner of challenge)
Algorithm for finding maximal cliques in hamming graph using brute force.
This project contains 3 implementations to solving the maximal clique problem.
Naive and optimized greedy solutions to the NP-Hard Vertex cover problem with a basic GUI
Add a description, image, and links to the np-hard-problem topic page so that developers can more easily learn about it.
To associate your repository with the np-hard-problem topic, visit your repo's landing page and select "manage topics."