#

polynomial-time

Here are 3 public repositories matching this topic...

chriskormaris / 2-SAT

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.

python np-hard 2-sat polynomial-time

Updated Mar 10, 2023
Python

ayush010998 / DynamicProgramming

Dyanamic programming algorithms in python

python memoization dynamic-programming tabulation dp polynomial-time

Updated Jul 19, 2023
Python

frankvegadelgado / alma

ALMA—MWX2SAT Solver

algorithms graph np-complete sat-solver ok polynomial-time

Updated Sep 19, 2024
Python

Improve this page

Add a description, image, and links to the polynomial-time topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the polynomial-time topic, visit your repo's landing page and select "manage topics."