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.
Reproducible materials for "[PNAS] A polynomial algorithm for best-subset selection problem"
python implementations of algorthims for the boolean satisfiability problem, including one to solve 3SAT in polynomial time
Trackability regimes for single-cell perturbation prediction: LAOT, synthetic phase transitions, and biological benchmarks.
This is an algorithm that given a Boolean formula with n=3 distinct variables and 2 variables per clause (2-Satisfiability), determines the values of the variables that result in the formula being TRUE, or determines that there is no solution and the formula is never TRUE. Written in Python.
TSP (Travelling Salesman Problem) plot in Java. It runs the TSP brute-force algorithm and draws the cycle of minimum distance among cities of random or fixed coordinates.
Dyanamic programming algorithms in python
Hvala: Approximate Vertex Cover Solver
Esperanza: Approximate Independent Set Solver
Salvador: Approximate Vertex Cover Solver
A novel experimental framework for P vs NP using Absolute Metaphysical Solipsism: exact syndrome-support theorems, puncture fusion, observer-centered compression, proof certificates, algorithms, obstructions, and reproducible research.
solver for the VAnishing DOmino pRoblem
😆 2-Satisfiability library for JavaScript
Simple application to visualize Blossom algorithm (introduced by Jack Edmonds)
💇♀️ Minimum cut algorithm for JavaScript
Reproducing research from ICLR 2018 by analyzing the evolution of a convolutional neural network in polynomial time.
To associate your repository with the polynomial-time topic, visit your repo's landing page and select "manage topics."