Sampling binary contingency tables with a greedy start (Q5898351): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Accelerating simulated annealing for the permanent and combinatorial counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo strategies in scientific computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow / rank
 
Normal rank

Latest revision as of 13:45, 25 June 2024

scientific article; zbMATH DE number 5122856
Language Label Description Also known as
English
Sampling binary contingency tables with a greedy start
scientific article; zbMATH DE number 5122856

    Statements

    Sampling binary contingency tables with a greedy start (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 February 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    greedy graph
    0 references
    bootstrapping
    0 references
    0 references