A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (Q5917580): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q56323948, #quickstatements; #temporary_batch_1707232231678 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56323948 / rank | |||
Normal rank | |||
Revision as of 17:47, 6 February 2024
scientific article; zbMATH DE number 2116457
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
