@Hadri

1 POSTS | 3 FOLLOWERS | 1 FOLLOWING

SINCE 2020-01-13

FORUM COMMENTS

An interesting video to understand the basis of P vs NP problem

Yeah, I hope that creating cryptographic keys that are not crackable is also a NP problem :p But my guess is that new security process will emerge as we discover how to bypass the older ones, that's how it has always been. Besides, note that there are problems which complexity is outside of PSPACE (so more complex than NP). They may be in EXP (like "what is the best move in chess"), EXPSPACE, ... Cryptographic solutions might ultimately move to these complexity spaces.

  • 2020-01-17
  • 1

Feel free to use and test the TML bot!

The bot is very responsive, updated regularly and there's always someone to help in using it if needed. A pleasure to use !

  • 2020-01-13
  • 1