Polynomial time perfect sampling algorithm for two-rowed contingency tables

MaRDI QIDQ3154676zbMATH OpenFDO

Authors Shuji Kijima, Tomomi Matsui

Publication date 14 January 2005

zbMATH Keywords

counting problem

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Recommendations

• Polynomial time perfect sampling algorithm for two-rowed contingency tables
• A genuinely polynomial-time algorithm for sampling two-rowed contingency tables
• Polynomial-time counting and sampling of two-rowed contingency tables
• Improved bounds for sampling contingency tables
• Random generation of 2�n contingency tables

Cited in

(6)

• Polynomial-time counting and sampling of two-rowed contingency tables
• Polynomial time perfect sampling algorithm for two-rowed contingency tables
• scientific article; zbMATH DE number 5280093 (Why is no real title available?)
• A genuinely polynomial-time algorithm for sampling two-rowed contingency tables
• Improved bounds for sampling contingency tables
• Perfect sampling on contingency tables with an application to SAGE data

This page was built for publication: Polynomial time perfect sampling algorithm for two-rowed contingency tables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3154676)