skip to content
 

NP search problems: Complexity and reducibilities

Presented by: 
S Buss University of California, San Diego
Date: 
Wednesday 28th March 2012 - 11:30 to 12:30
Venue: 
INI Seminar Room 1
Abstract: 
This is the first of two tutorial talks on total NP search problems. Full abstract not yet available.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
Presentation Material: 
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons