10% OFF
language: english
Publisher: CAMBRIDGE UNIVERSITY PRESS, March of 2014 ‧
85,17€
10% OFF CARD
free shipping
Sell ​​your book
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. The result is a uniform treatment of many systems in the literature.

Logical Foundations Of Proof Complexity

by Phuong (Mcgill University, Montreal) Nguyen e Stephen (University Of Toronto) Cook

Property Description
ISBN: 9781107694118
Publisher: CAMBRIDGE UNIVERSITY PRESS
Release Date: March of 2014
Language: English
Dimensions: 156 x 234 x 28 mm
Cover: Softcover
Pages: 496
Format: Book
Collection: Cambridge English Readers
Categories: Books in English > Science > Mathematics
Books in English > Others
EAN: 9781107694118