Documents 1 NP-Complete Problems. 2 We discuss some hard problems: how hard? (computational complexity) what...

Slide 1 1 NP-Complete Problems Slide 2 2 We discuss some hard problems:  how hard? (computational complexity)  what makes them hard?  any solutions? Definitions…

Documents 1 Authenticated Adversarial Routing Yair Amir, Paul Bunn, Rafail Ostrovsky 6 th IACR Theory of...

Slide 1 1 Authenticated Adversarial Routing Yair Amir, Paul Bunn, Rafail Ostrovsky 6 th IACR Theory of Cryptography Conference March 15, 2009 Slide 2 2 Authenticated Adversarial…