Pages that link to "Item:Q3057067"
From MaRDI portal
The following pages link to An approximation algorithm for counting contingency tables (Q3057067):
Displaying 18 items.
- Random partitioning over a sparse contingency table (Q421428) (← links)
- On testing Hamiltonicity of graphs (Q468434) (← 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)
- Counting subsets of contingency tables (Q2259711) (← links)
- Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases (Q2355167) (← links)
- Lower bounds for contingency tables via Lorentzian polynomials (Q2698417) (← links)
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums (Q2841356) (← links)
- (Q4029621) (← links)
- Sampling contingency tables (Q4345364) (← links)
- Fast Unimodular Counting (Q4500424) (← links)
- Improved bounds for sampling contingency tables (Q4803313) (← links)
- Majorization and the number of bipartite graphs for given vertex degrees (Q5135453) (← links)
- Phase transition in random contingency tables with non-uniform margins (Q5147423) (← links)
- The Algebraic Analysis of Contingency Tables (Q5846549) (← links)
- Sampling binary contingency tables with a greedy start (Q5898351) (← links)
- On the number of contingency tables and the independence heuristic (Q6175406) (← links)
