skip to content
 

A polynominal-time algorithm to approximately count contingency tables when the number of rows is constant

Presented by: 
M Cryan [Leeds]
Date: 
Thursday 8th August 2002 - 16:00 to 17: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