|
|
|
|
|
|
by mihaild
3230 days ago
|
|
|
There is Universal Search algorithm. If P=NP, it finds a solution for solvable 3-SAT in polynomial time.
(still not solving 3-SAT itself in case we will not be able to determine running time, but in cryptography AFAIK we usually need solutions for known-solvable instances) |
|
|