|
|
|
|
|
|
by lacker
2366 days ago
|
|
|
It would be pretty handy for cryptography to have a better understanding of which problems were hard. P != NP we are already assuming, but if we could use the mechanism on other problems (like knowledge of exponent, discrete log, etc) it would help. |
|
|