Main image
Click to view image in fullscreen
![]()
Bounded Arithmetic, Propositional Logic and Complexity Theory
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.
1 420,00 DH
Sur commande
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.
| ISBN / EAN | 9780521452052 |
|---|---|
| Auteur | Krajicek, Jan (Academy of Sciences of the Czech Republic, Prague) |
| Editeur | Cambridge University Press |