Excursion to Discrete Probability: Computing the Expected Minimum of k Random Elements from {1,...,n}

Loading...
來自 Shanghai Jiao Tong University 的課程
Discrete Mathematics
65 個評分
Shanghai Jiao Tong University
65 個評分
從本節課中
The Binomial Coefficient
The binomial coefficient (n choose k) counts the number of ways to select k elements from a set of size n. It appears all the time in enumerative combinatorics. A good understanding of (n choose k) is also extremely helpful for analysis of algorithms.

與講師見面

  • Dominik Scheder
    Dominik Scheder
    Assistant Professor
    The Department of Computer Science and Engineering

探索我們的目錄

免費加入並獲得個性化推薦、更新和優惠。