Computational Complexity
Pioneering quantum cryptographer Prof. Artur Ekert and the notion of computational complexity, a way of objectively distinguishing between “easy” and “hard” mathematical problems.
Tag: Cryptography
Connecting the IB Diploma Programme with the World of Research