A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (Q5917580)

From MaRDI portal
Revision as of 17:47, 6 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56323948, #quickstatements; #temporary_batch_1707232231678)
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
    0 references
    0 references
    18 November 2004
    0 references
    Contingency tables
    0 references
    Approximate counting
    0 references
    Randomized algorithms
    0 references

    Identifiers