Notable P vs. NP proof attempts.
-
Updated
Aug 18, 2023
#
p-vs-np
Here are 6 public repositories matching this topic...
This repository was setup to help people who believe that they solved the P vs NP problem and to help the people who review proposed solutions.
polynomial-time
computational-complexity
non-determinism
complexity-theory
millennium-problems
p-vs-np
unsolved-problems
-
Updated
Oct 24, 2022
python implementations of algorthims for the boolean satisfiability problem, including one to solve 3SAT in polynomial time
-
Updated
Feb 21, 2024 - TeX
Labs for the Advanced Algorithms course
algorithms
graph-algorithms
dynamic-programming
state-machines
depth-first-search
string-matching
string-search
heaps
red-black-trees
deflate-algorithm
boyer-moore-algorithm
splay-trees
p-vs-np
euler-circuit
-
Updated
Aug 31, 2023 - C++
All assignments for CS 218: Design and Analysis of Algorithms, Spring 2021, IIT Bombay
-
Updated
Apr 16, 2021 - TeX
Coursera Data Structures and Algorithms Specialization course 5 --> Advanced Algorithms and Complexity... Code is completed in python only.
-
Updated
Sep 29, 2020 - Python
Improve this page
Add a description, image, and links to the p-vs-np topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the p-vs-np topic, visit your repo's landing page and select "manage topics."