skip to content
 

The compexity of sampling (and approximately counting graph homomorphism

Presented by: 
L Goldberg [Warwick]
Date: 
Monday 12th August 2002 - 14:00 to 15:00
Venue: 
INI Seminar Room 1
Session Title: 
Randomised Algorithms
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons