Advertisement

Random generation of combinatiorial structures from a uniform distribution

  • Mark Jerrum
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 194)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bach, E. How to Generate Random Integers with Known Factorisation. Proceedings of the 15th ACM Symposium on Theory of Computing, 1983, pp. 184–188.Google Scholar
  2. 2.
    Dixon, J.D. and Wilf, H.S. The Random Selection of Unlabelled Graphs. J. Algorithms 4 (1983), pp. 205–213.CrossRefGoogle Scholar
  3. 3.
    Garey, M.R. and Johnson, D.S. Computers and Intractability. Freeman, 1979.Google Scholar
  4. 4.
    Gill, J. Computational Complexity of Probabilistic Turing Machines. SIAM J. on Computing 6 (1977), pp. 675–695.CrossRefGoogle Scholar
  5. 5.
    Harary, F. and Palmer, E.M. Craphical Enumeration. Academic Press, 1973.Google Scholar
  6. 6.
    Hopcroft, J.E. and Ullman, J.D. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    Stockmeyer, L. The Polynomial-time Hierarchy. Theoretical Computer Science 3 (1977), pp. 1–22.CrossRefGoogle Scholar
  11. 11.
    Stockmeyer, L. The Complexity of Approximate Counting. Proceedings of the 15th ACM Symposium on Theory of Computing, 1983, pp. 118–126.Google Scholar
  12. 12.
    Valiant, L.G. The Complexity of Combinatorial Computations: an Introduction. Internal Report CSR-30-78, Department of Computer Science, University of Edinburgh, October, 1978.Google Scholar
  13. 13.
    Valiant, L.G. The Complexity of Computing the Permanent. Theoretical Computer Science 8 (1979), pp. 189–201.CrossRefGoogle Scholar
  14. 14.
    Wilf, H.S. The Uniform Selection of Free Trees. J. Algorithms 2 (1981), pp. 204–207.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Mark Jerrum
    • 1
  1. 1.Department of Computer ScienceUniversity of EdinburghUK

Personalised recommendations