skip to content

On the possibility, and impossiblity, of interruptible perfect sampling

Presented by: 
J Fill Johns Hopkins University
Friday 16th August 2002 - 10:00 to 11:00
INI Seminar Room 1
Session Title: 
Randomised Algorithms
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons