Concepedia

A Quasi-polynomial-time Algorithm for Sampling Words from a Context-Free Language

Vivek Gore, Mark Jerrum, Sampath Kannan, Z. Sweedyk, Steve Mahaney

Information and Computation · 1997 · 41 citations · 18 references

DOI

Concepts

References

18

Probability Inequalities for Sums of Bounded Random Variables

Wassily Hoeffding · Journal of the American Statistical Association · 1963 · 4.8K citations

, , +12

Random generation of combinatorial structures from a uniform distribution

Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani · Theoretical Computer Science · 1986 · 1K citations

, , +12

Monte-Carlo approximation algorithms for enumeration problems

Richard M. Karp, Michael Luby, Neal Madras · Journal of Algorithms · 1989 · 334 citations

, , +7

Monte-Carlo algorithms for enumeration and reliability problems

Richard M. Karp, Michael Luby · 1983 · 323 citations

, , +14

Fast Parallel Computation of Polynomials Using Few Processors

Leslie G. Valiant, Sven Skyum, S. J. Berkowitz et al. · SIAM Journal on Computing · 1983 · 283 citations

, , +10