Pages that link to "Item:Q4651494"
From MaRDI portal
The following pages link to The Complexity of Three-Way Statistical Tables (Q4651494):
Displaying 18 items.
- Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory (Q314827) (← links)
- A polynomial oracle-time algorithm for convex integer minimization (Q623465) (← links)
- \(N\)-fold integer programming and nonlinear multi-transshipment (Q628649) (← links)
- Nonlinear bipartite matching (Q924630) (← links)
- \(N\)-fold integer programming (Q951095) (← links)
- Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes (Q984027) (← links)
- Convex integer maximization via Graver bases (Q1017675) (← links)
- Graphs of transportation polytopes (Q1040845) (← links)
- On properties of multi-dimensional statistical tables (Q1410284) (← links)
- Gröbner bases and polyhedral geometry of reducible and cyclic models. (Q1865397) (← links)
- On the complexity of computing Kronecker coefficients (Q2012174) (← links)
- Bounds on Kronecker coefficients via contingency tables (Q2185845) (← links)
- Computational complexity of three-dimensional discrete tomography with missing data (Q2231602) (← links)
- A formulation of the wide partition conjecture using the atom problem in discrete tomography (Q2440106) (← links)
- Markov bases of three-way tables are arbitrarily complicated (Q2457324) (← links)
- Permutohedra and minimal matrices (Q2576235) (← links)
- Lower bounds for contingency tables via Lorentzian polynomials (Q2698417) (← links)
- Huge Unimodular $n$-Fold Programs (Q3455242) (← links)
