P=NP? A reduction of CNF boolean satisfiability to the circulation problem in an undirected graph
-
Notifications
You must be signed in to change notification settings - Fork 0
srogatch/bsat-circulation
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
P=NP? A reduction of CNF boolean satisfiability to the circulation problem in an undirected graph
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published