Random generation of combinatorial structures from a uniform distribution
- 1 January 1986
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 43, 169-188
- https://doi.org/10.1016/0304-3975(86)90174-x
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The random selection of unlabeled graphsJournal of Algorithms, 1983
- The uniform selection of free treesJournal of Algorithms, 1981
- The complexity of computing the permanentTheoretical Computer Science, 1979
- The Complexity of Combinatorial Computations: An IntroductionPublished by Springer Nature ,1978
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- The polynomial-time hierarchyTheoretical Computer Science, 1976