A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph (Q2375856)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6180646
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph |
scientific article; zbMATH DE number 6180646 |
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
0.8824408
0 references
0.88131183
0 references
0 references
0.87035877
0 references
0.8670238
0 references
0.86616564
0 references
0.8656097
0 references
0.86306286
0 references
0.8627223
0 references
