随机算法 (Fall 2011): Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
Line 74: Line 74:
#* [[随机算法 (Fall 2011)/The #P Class and Approximation|The #P Class and Approximation]]
#* [[随机算法 (Fall 2011)/The #P Class and Approximation|The #P Class and Approximation]]
#* [[随机算法 (Fall 2011)/DNF Counting|DNF Counting]]
#* [[随机算法 (Fall 2011)/DNF Counting|DNF Counting]]
#* [[随机算法 (Fall 2011)/Sampling and Counting|Sampling and Counting]]
#* [[随机算法 (Fall 2011)/Canonical Paths|Canonical Paths]]
#* [[随机算法 (Fall 2011)/Canonical Paths|Canonical Paths]]
#* [[随机算法 (Fall 2011)/Count Matchings|Count Matchings]]
#* [[随机算法 (Fall 2011)/Count Matchings|Count Matchings]]
#* [[随机算法 (Fall 2011)/Sampling and Counting|Sampling and Counting]]
# MCMC
# MCMC
#* [[随机算法 (Fall 2011)/Spin Systems|Spin Systems]]
#* [[随机算法 (Fall 2011)/Spin Systems|Spin Systems]]

Revision as of 15:47, 19 July 2011

Lecture Notes

  1. Introduction
  2. Probability Basics
  3. Balls and Bins
  4. Moment and Deviation
  5. Hashing and Fingerprinting
  6. Chernoff Bound
  7. Concentration of Measure
  8. Dimension Reduction
  9. The Probabilistic Method
  10. Approximation Algorithms
  11. Markov Chain and Random Walk
  12. Random Walk Algorithms
  13. Coupling and Mixing Time
  14. Expander Graphs I
  15. Expander Graphs II
  16. Sampling and Counting
  17. MCMC
  18. Complexity