Random generation of combinatorial structures from a uniform distribution

Theoretical Computer Science

Volumn 43, Issue C, 1986, Pages 169-188

  Jerrum, Mark R ^a   Valiant, Leslie G ^b   Vazirani, Vijay V ^c  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b HARVARD UNIVERSITY   (United States)

^c Department of Molecular Biology and Genetics   (United States)

Author keywords

F.1.1; F.1.3; G.2.1; G.3

Indexed keywords

EID: 38249043088     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(86)90174-X     Document Type: Article

References (16)

1. How to generate random integers with known factorisation
2. The random selection of unlabelled graphs
3. Computational complexity of probabilistic Turing machines
4. Monte-Carlo algorithms for enumeration and reliability problems
5. Optimal algorithms for self-reducible problems
6. On the difference between one and many
7. A complexity-theoretićapproach to randomness
8. The polynomial-time hierarchy
9. The complexity of approximate counting
10. The complexity of combinatorial computations An introduction
11. The complexity of computing the permanent
12. NP is as easy as detecting unique solutions
13. The uniform selection of free trees