Random generation of combinatorial structures from a uniform distribution (Q1079379): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The random selection of unlabeled graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte-Carlo algorithms for the planar multiterminal network reliability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4184337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank

Revision as of 14:16, 17 June 2024

scientific article
Language Label Description Also known as
English
Random generation of combinatorial structures from a uniform distribution
scientific article

    Statements

    Random generation of combinatorial structures from a uniform distribution (English)
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    probabilistic Turing machine
    0 references
    uniform generation
    0 references
    approximate counting
    0 references
    polynomial hierarchy
    0 references

    Identifiers