Pages that link to "Item:Q2457324"
From MaRDI portal
The following pages link to Markov bases of three-way tables are arbitrarily complicated (Q2457324):
Displaying 9 items.
- Exact inference in contingency tables via stochastic approximation Monte Carlo (Q395934) (← links)
- Support sets in exponential families and oriented matroid theory (Q541842) (← links)
- \(N\)-fold integer programming and nonlinear multi-transshipment (Q628649) (← links)
- The Graver complexity of integer programming (Q659795) (← links)
- Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities (Q892799) (← links)
- \(N\)-fold integer programming (Q951095) (← links)
- Convex integer maximization via Graver bases (Q1017675) (← links)
- Graphs of transportation polytopes (Q1040845) (← links)
- Exact test of goodness of fit for binomial distribution (Q1785804) (← links)
