Previous Conferences & Workshops

This lecture, accessible to a wide audience, explores how mathematics has arrived at its present pragmatic view of infinity and some of the counterintuitive paradoxes, as well as some of the positive results, deriving from its acceptance. The...

Sipser and Gács, and independently Lautemann, proved in '83 that probabilistic polynomial time is contained in the second level of the polynomial-time hierarchy, i.e. BPP is in \Sigma_2 P. This is essentially the only non-trivial upper bound that we...

Suppose we have n players who wish to jointly perform a quantum computation, but some of them are faulty and are trying to learn privileged information and/or sabotage the computation. How many cheaters can we tolerate and still have a secure...