Random Generation of Combinatorial Structures from a Uniform Distribution

@article{Jerrum1986RandomGO,
  title={Random Generation of Combinatorial Structures from a Uniform Distribution},
  author={M. Jerrum and L. Valiant and V. Vazirani},
  journal={Theor. Comput. Sci.},
  year={1986},
  volume={43},
  pages={169-188}
}
Abstract The class of problems involving the random generation of combinatorial structures from a uniform distribution is considered. Uniform generation problems are, in computational difficulty, intermediate between classical existence and counting problems. It is shown that exactly uniform generation of ‘efficiently verifiable’ combinatorial structures is reducible to approximate counting (and hence, is within the third level of the polynomial hierarchy). Natural combinatorial problems are… Expand
936 Citations
Random Generation and Approximate Counting of Combinatorial Structures
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures
Counting and random generation of strings in regular languages
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages
On the Random Generation and Counting of Matchings in Dense Graphs
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 20 REFERENCES
The complexity of approximate counting
The Uniform Selection of Free Trees
  • H. Wilf
  • Mathematics, Computer Science
  • J. Algorithms
  • 1981
The Complexity of Combinatorial Computations: An Introduction
  • L. Valiant
  • Mathematics, Computer Science
  • GI Jahrestagung
  • 1978
How to generate random integers with known factorization
  • E. Bach
  • Mathematics, Computer Science
  • STOC '83
  • 1983
The Polynomial-Time Hierarchy
  • L. Stockmeyer
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1976
Monte-Carlo algorithms for enumeration and reliability problems
  • R. Karp, M. Luby
  • Computer Science
  • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
On the Difference Between One and Many (Preliminary Version)
The Complexity of Computing the Permanent
  • L. Valiant
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1979
A complexity theoretic approach to randomness
...
1
2
...