University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Yin and Yang of Computer Science: Algorithms versus Lower Bounds

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

Yin and Yang of Computer Science: Algorithms versus Lower Bounds

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

If you have a question about this talk, please contact Mustapha Amrani.

This talk has been canceled/deleted

2012/05/03

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.

Other lists

Anglia Ruskin University - Community Engagement Thinking Society: General and Particular Murray Edwards College

Other talks

The role of the oculomotor system in visual attention and visual short-term memory Biopolymers for photonics - painting opals with water and light How to make good scientific figures Mass Spectrometry ADMM for Exploiting Structure in MPC Problems Fluorescence spectroscopy and Microscale thermophoresis Constructing the virtual fundamental cycle An SU(3) variant of instanton homology for webs 'Walking through Language – Building Memory Palaces in Virtual Reality' Singularities of Hermitian-Yang-Mills connections and the Harder-Narasimhan-Seshadri filtration Ethics for the working mathematician, seminar 9 CANCELLED
 

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