10% OFF
language: english
Publisher: CAMBRIDGE UNIVERSITY PRESS, January of 2010 ‧
148,71€
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: 9780521517294
Publisher: CAMBRIDGE UNIVERSITY PRESS
Release Date: January of 2010
Language: English
Cover: Hardcover
Pages: 496
Format: Book
Categories: Books in English > Science > Mathematics
Books in English > Others
EAN: 9780521517294