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.
In line with the commitment of�Cambridge University Press�to advance learning, knowledge and research worldwide, the Press currently publishes over 250 peer-reviewed academic journals for the global market. Containing the latest research from a broad sweep of subject areas, Cambridge journals are accessible worldwide in print and online.