Here's a constructive proof that P = NP and the Integer Factorization Problem is NP-Complete.
-
Notifications
You must be signed in to change notification settings - Fork 0
3SAT solver and integer factorizer
License
bcroner/getfactors
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
3SAT solver and integer factorizer
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published