Pages that link to "Item:Q5917580"
From MaRDI portal
The following pages link to A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (Q5917580):
Displaying 12 items.
- Sequential Monte Carlo for counting vertex covers in general graphs (Q294226) (← links)
- On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries (Q652625) (← links)
- Random sampling of contingency tables via probabilistic divide-and-conquer (Q782654) (← links)
- A faster FPTAS for counting two-rowed contingency tables (Q1983128) (← links)
- On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \) (Q2179619) (← links)
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums (Q2841356) (← links)
- An approximation algorithm for counting contingency tables (Q3057067) (← links)
- Power analysis of independence testing for three-way contingency tables of small sizes (Q5036344) (← links)
- Some contributions to practice of 2 × 2 contingency tables (Q5036617) (← links)
- On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries (Q5323079) (← links)
- Enumerating Contingency Tables via Random Permanents (Q5448988) (← links)
- Linear-time uniform generation of random sparse contingency tables with specified marginals (Q6590451) (← links)
