💇♀️ Minimum cut algorithm for JavaScript
-
Updated
Aug 14, 2024 - JavaScript
💇♀️ Minimum cut algorithm for JavaScript
ALMA—MWX2SAT Solver
python implementations of algorthims for the boolean satisfiability problem, including one to solve 3SAT in polynomial time
Dyanamic programming algorithms in python
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.
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.
😆 2-Satisfiability library for JavaScript
solver for the VAnishing DOmino pRoblem
Reproducing research from ICLR 2018 by analyzing the evolution of a convolutional neural network in polynomial time.
Simple application to visualize Blossom algorithm (introduced by Jack Edmonds)
Add a description, image, and links to the polynomial-time topic page so that developers can more easily learn about it.
To associate your repository with the polynomial-time topic, visit your repo's landing page and select "manage topics."