Produkt mají v nabídce:
Bounded Arithmetic, Propositional Logic and Complexity Theory - Krajicek, Jan (Academy of Sciences of the Czech Republic, Prague)
An up-to-date, unified treatment of research in this interdisciplinary subject, with emphasis on independence proofs and lower bound proofs. The author discusses the deep connections between logic and computational complexity theory and lists a number of intriguing open problems.
