Notable P vs. NP proof attempts.
-
Updated
Aug 18, 2023
Notable P vs. NP proof attempts.
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.
python implementations of algorthims for the boolean satisfiability problem, including one to solve 3SAT in polynomial time
Formal verification of the logical incompatibility between the P=NP hypothesis and the Witten-Helffer-Sjöstrand tunneling theorems in spectral geometry. Implemented in Lean 4.
A comprehensive Python framework for parsing, transforming, and benchmarking CNF files for SAT solving research.
Labs for the Advanced Algorithms course
All assignments for CS 218: Design and Analysis of Algorithms, Spring 2021, IIT Bombay
Reframing the P vs NP Problem
Informational Repo covering the Satisfiability of formulas in 3 Conjunctive Normal Form. Includes Demos of solving algorithms, and detailed analysis.
An structured attempt at a Polynomial -Time Solution to the NP-complete Subset Sum Problem.
Código del TFG de Ingeniería Informática / Code for the Computer Science Bacherlor's Thesis
Coursera Data Structures and Algorithms Specialization course 5 --> Advanced Algorithms and Complexity... Code is completed in python only.
Add a description, image, and links to the p-vs-np topic page so that developers can more easily learn about it.
To associate your repository with the p-vs-np topic, visit your repo's landing page and select "manage topics."