Published bimonthly, Combinatorics, Probability & Computing is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.

《組合學(xué)、概率與計(jì)算》雙月刊，致力于組合學(xué)、概率論和理論計(jì)算機(jī)科學(xué)三個領(lǐng)域的研究。主題包括經(jīng)典圖論、代數(shù)圖論、極值集論、擬陣論、概率方法和隨機(jī)組合結(jié)構(gòu);隨機(jī)組合結(jié)構(gòu)的組合概率與極限定理算法理論(包括復(fù)雜性理論)，隨機(jī)算法，算法的概率分析，計(jì)算學(xué)習(xí)理論和優(yōu)化。