Combinatorics, Probability & Computing
Combinator Probab Comput
Now 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.
- Further information
- Category Link