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

DOI10.1145/509907.509946zbMath1192.68886OpenAlexW1999757918MaRDI QIDQ5901055

Mary Cryan, Martin Dyer

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/16869013/A_polynomial_time_algorithm_to_approximately_count_contingency_tables_when_the_number_of_rows_is_constant.pdf

Mathematics Subject Classification ID

Approximation algorithms (68W25) Randomized algorithms (68W20)

This page was built for publication: A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant