University of Cambridge > > UCCPS > Almost Certainly Correct

Almost Certainly Correct

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Arthur Conmy.

Solutions to most competitive programming problems are evaluated based on whether they return the expected result on a finite set of test cases. This means that the algorithm you devise need not be perfect. In this talk I will show how we can utilise randomness in designing fast and simple algorithms that are almost guaranteed to solve problems where a perfect solution has a very high computational cost.

This talk is part of the UCCPS series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity