A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (Q5917580)
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 2116457
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant |
scientific article; zbMATH DE number 2116457 |
Statements
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (English)
0 references
18 November 2004
0 references
Contingency tables
0 references
Approximate counting
0 references
Randomized algorithms
0 references
0 references
0 references
0 references
0.9152265191078186
0 references
0.8998984694480896
0 references
0.8998984694480896
0 references
0.8674874901771545
0 references
0.8667186498641968
0 references
