A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph (Q2375856)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph |
scientific article |
Statements
A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph (English)
0 references
25 June 2013
0 references
algebraic statistics
0 references
contingency table
0 references
three-way transportation program
0 references
