Preview
Unable to display preview. Download preview PDF.
References
Bach, E. How to Generate Random Integers with Known Factorisation. Proceedings of the 15th ACM Symposium on Theory of Computing, 1983, pp. 184–188.
Dixon, J.D. and Wilf, H.S. The Random Selection of Unlabelled Graphs. J. Algorithms 4 (1983), pp. 205–213.
Garey, M.R. and Johnson, D.S. Computers and Intractability. Freeman, 1979.
Gill, J. Computational Complexity of Probabilistic Turing Machines. SIAM J. on Computing 6 (1977), pp. 675–695.
Harary, F. and Palmer, E.M. Craphical Enumeration. Academic Press, 1973.
Hopcroft, J.E. and Ullman, J.D. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
Karp, R.M. and Luby, M. Monte-Carlo Algorithms for Enumeration and Reliability Problems. Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, 1983, pp. 56–64.
Schnorr, C.P. Optimal Algorithms for Self-Reducible Problems. Proceedings of the 3rd International Colloquium on Automata, Languages and Programming, EATCS, 1976, pp. 322–337.
Simon, J. On the Difference between One and Many. Proceedings of the 4th International Colloquium on Automata, Languages and Programming, EATCS, 1977, pp. 480–491.
Stockmeyer, L. The Polynomial-time Hierarchy. Theoretical Computer Science 3 (1977), pp. 1–22.
Stockmeyer, L. The Complexity of Approximate Counting. Proceedings of the 15th ACM Symposium on Theory of Computing, 1983, pp. 118–126.
Valiant, L.G. The Complexity of Combinatorial Computations: an Introduction. Internal Report CSR-30-78, Department of Computer Science, University of Edinburgh, October, 1978.
Valiant, L.G. The Complexity of Computing the Permanent. Theoretical Computer Science 8 (1979), pp. 189–201.
Wilf, H.S. The Uniform Selection of Free Trees. J. Algorithms 2 (1981), pp. 204–207.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jerrum, M. (1985). Random generation of combinatiorial structures from a uniform distribution. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015754
Download citation
DOI: https://doi.org/10.1007/BFb0015754
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15650-5
Online ISBN: 978-3-540-39557-7
eBook Packages: Springer Book Archive