Reproducible materials for "A polynomial algorithm for best-subset selection problem"

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.

Capablanca: 2-Approximation Dominating Set Solver

python implementations of algorthims for the boolean satisfiability problem, including one to solve 3SAT in polynomial time

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.

Alonso: Approximate Vertex Cover Solver

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

Varela: Approximate Vertex Cover Solver

😆 2-Satisfiability library for JavaScript

solver for the VAnishing DOmino pRoblem

Polytime Algorithm Libraries

Simple application to visualize Blossom algorithm (introduced by Jack Edmonds)

Reproducing research from ICLR 2018 by analyzing the evolution of a convolutional neural network in polynomial time.

💇‍♀️ Minimum cut algorithm for JavaScript