University of Cambridge > Talks.cam > UCCPS > Almost Certainly Correct

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Almost Certainly Correct

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Webinar & FW11, Computer Laboratory, William Gates Building. Webinar & FW11, Computer Laboratory, William Gates Building. McDonald Institute Seminar Room, Downing Site

Other talks

Online Causal Inference Seminar How Much Does Homology Really Know? Title to be confirmed Rothschild Public Lecture: Forty years of causal inference: Report of a great-grandfather Not-so-noble gases, key tracers of Earth’s habitability: what their behaviour in planetary interiors can tell us? Evolution: Inevitable or Remarkable?
 

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