Produkt mají v nabídce:
Forcing with Random Variables and Proof Complexity - Krajicek, Jan (Charles University, Prague)
Aimed at researchers and graduate students in mathematics and theoretical computer science, who are interested in logical approaches to fundamental problems of computational complexity theory, and of proof complexity in particular.