Re: [hackers-il] lecture
- The abstract for the lecture is:
and another cool lecture is Adi Shamir about GSM cryptography
Chen Shapira Web Developer and Linux Activist
The algorithm for finding the longest path in a graph is NP-complete.
For you systems people, that means it's *real slow*.