- We will send in 10–14 business days.
/images/books/5635473/9781107694118.jpg)
- Author: Stephen Cook
- Publisher: Cambridge University Press
- ISBN-10: 1107694116
- ISBN-13: 9781107694118
- Format: 15.6 x 23.4 x 2.8 cm, softcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. Associated with each of many complexity classes are both a two-sorted predicate calculus theory, with induction restricted to concepts in the class, and a propositional proof system. The result is a uniform treatment of many systems in the literature, including Buss's theories for the polynomial hierarchy and many disparate systems for complexity classes such as AC0, AC0(m), TC0, NC1, L, NL, NC, and P.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 19d.14:47:39
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Stephen Cook
- Publisher: Cambridge University Press
- ISBN-10: 1107694116
- ISBN-13: 9781107694118
- Format: 15.6 x 23.4 x 2.8 cm, softcover
- Language: English English
This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. Associated with each of many complexity classes are both a two-sorted predicate calculus theory, with induction restricted to concepts in the class, and a propositional proof system. The result is a uniform treatment of many systems in the literature, including Buss's theories for the polynomial hierarchy and many disparate systems for complexity classes such as AC0, AC0(m), TC0, NC1, L, NL, NC, and P.
Reviews