bsat-circulation

P=NP? A reduction of CNF boolean satisfiability to the circulation problem in an undirected graph

Name		Name	Last commit message	Last commit date
Latest commit History 154 Commits
.vscode		.vscode
.gitignore		.gitignore
.gitmodules		.gitmodules
BSAT.cpp		BSAT.cpp
BitVector.h		BitVector.h
BlockingQueue.h		BlockingQueue.h
CNF.h		CNF.h
Graph.h		Graph.h
MaxFlow.h		MaxFlow.h
README.md		README.md
Reduction.h		Reduction.h
SatTracker.h		SatTracker.h
TrackingSet.h		TrackingSet.h
Traversal.h		Traversal.h
Utils.h		Utils.h
build.sh		build.sh

Navigation Menu